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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2013
|
| Online Access: | https://hdl.handle.net/10356/98777 http://hdl.handle.net/10220/12552 |