Local and global price of anarchy of graphical games

DOI10.1016/J.TCS.2010.12.064zbMATH Open1208.91026OpenAlexW2065532493MaRDI QIDQ631783FDOQ631783

Authors: Oren Ben-Zwi, Amir Ronen 

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

Recommendations

• The Local and Global Price of Anarchy of Graphical Games
• The price of anarchy in large games
• Intrinsic robustness of the price of anarchy
• Intrinsic robustness of the price of anarchy
• Coordination games on graphs

zbMATH Keywords

price of anarchygraphical gameslocal global properties

Mathematics Subject Classification ID

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

Cites Work

• Non-cooperative games
• Algorithmic Game Theory
• Worst-case equilibria
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Network games
• Low diameter graph decompositions
• The price of routing unsplittable flow
• The complexity of computing a Nash equilibrium
• Title not available (Why is that?)
• When ignorance helps: graphical multicast cost sharing games
• When Ignorance Helps: Graphical Multicast Cost Sharing Games

Cited In (4)

• Hats, auctions and derandomization
• The Local and Global Price of Anarchy of Graphical Games
• Topological price of anarchy bounds for clustering games on networks
• Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games

This page was built for publication: Local and global price of anarchy of graphical games

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