Local and global price of anarchy of graphical games

DOI10.1016/j.tcs.2010.12.064zbMath1208.91026OpenAlexW2065532493MaRDI QIDQ631783

Amir Ronen, Oren Ben-Zwi

Publication date: 14 March 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.064

zbMATH Keywords

price of anarchygraphical gameslocal global properties

Mathematics Subject Classification ID

Games involving graphs (91A43) (n)-person games, (n>2) (91A06)

Related Items

Hats, auctions and derandomization

Cites Work

• Unnamed Item
• Unnamed Item
• When ignorance helps: graphical multicast cost sharing games
• Low diameter graph decompositions
• Non-cooperative games
• The complexity of computing a Nash equilibrium
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Network Games
• When Ignorance Helps: Graphical Multicast Cost Sharing Games
• Algorithmic Game Theory
• The Price of Routing Unsplittable Flow