Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structure

We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by potential function arguments. Unfortunately, this proof of existence is ineff...

Full description

Saved in:
Bibliographic Details
Main Authors: Caragiannis, Ioannis, Fanelli, Angelo, Gravin, Nick, Skopalik, Alexander
Other Authors: School of Physical and Mathematical Sciences
Format: Conference or Workshop Item
Language:English
Published: 2013
Online Access:https://hdl.handle.net/10356/98777
http://hdl.handle.net/10220/12552
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English