Asynchronous Congestion Games
From MaRDI portal
Publication:3655138
DOI10.1007/978-3-642-02029-2_5zbMath1194.91033MaRDI QIDQ3655138
Moshe Tennenholtz, Michal Penn, Maria Polukarov
Publication date: 7 January 2010
Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/267876/1/ACG_30Jan2008_AAMAS_short.pdf
68Q25: Analysis of algorithms and problem complexity
91A10: Noncooperative games
91A06: (n)-person games, (n>2)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Congestion games with load-dependent failures: Identical resources
- Truthful algorithms for scheduling selfish tasks on parallel machines
- Distributed games
- Potential games
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Asynchronous Congestion Games
- STACS 2004
- Algorithmic mechanism design