Asynchronous congestion games

DOI10.1007/978-3-642-02029-2_5MaRDI QIDQ3655138zbMATH OpenOpenAlexFDO

Authors Michal Penn, Maria Polukarov, Moshe Tennenholtz

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) (n)-person games, (n>2) (91A06) Noncooperative games (91A10)

Recommendations

• Random order congestion games
• Games with congestion-averse utilities
• Congestion games with mixed objectives
• Congestion games with capacitated resources
• Convergence to approximate Nash equilibria in congestion games

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Algorithmic mechanism design
• Asynchronous congestion games
• Congestion games with load-dependent failures: Identical resources
• Congestion games with player-specific payoff functions
• Distributed games
• scientific article; zbMATH DE number 5604092 (Why is no real title available?)
• Potential games
• Solution-based congestion games
• STACS 2004
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• Truthful algorithms for scheduling selfish tasks on parallel machines

Cited in

(5)

• Asynchronous games. II: The true concurrency of innocence
• Random order congestion games
• Asynchronous congestion games
• Asynchronous Games over Tree Architectures
• Impact of asynchrony on the behavior of rational selfish agents

This page was built for publication: Asynchronous congestion games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655138)