The impact of social ignorance on weighted congestion games

DOI10.1007/s00224-011-9355-2zbMath1262.91008WikidataQ59818423 ScholiaQ59818423MaRDI QIDQ692896

Vasilis Gkatzelis, Paul G. Spirakis, Dimitris Fotakis, Alexis C. Kaporis

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9355-2

zbMATH Keywords

congestion games; price of anarchy; algorithmic game theory

Mathematics Subject Classification ID

91A10: Noncooperative games

91A06: (n)-person games, (n>2)

Related Items

Inefficiency of games with social context, Social learning in nonatomic routing games, A Glimpse at Paul G. Spirakis, A Selective Tour Through Congestion Games

Cites Work

• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• Graphical congestion games
• Tight bounds for selfish and greedy load balancing
• On best response dynamics in weighted congestion games with polynomial delays
• When ignorance helps: graphical multicast cost sharing games
• Selfish routing with incomplete information
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• The Price of Stability for Network Design with Fair Cost Allocation
• On the impact of combinatorial structure on congestion games
• The Speed of Convergence in Congestion Games under Best-Response Dynamics
• Selfish Load Balancing Under Partial Knowledge
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• On the Performance of Approximate Equilibria in Congestion Games
• Selfish Routing with Oblivious Users
• Exact Price of Anarchy for Polynomial Congestion Games
• Algorithms – ESA 2005
• The Price of Routing Unsplittable Flow