Robust price of anarchy bounds via LP and Fenchel duality

DOI10.1137/1.9781611973730.70MaRDI QIDQ5363045zbMATH OpenOpenAlexFDO

Authors Janardhan Kulkarni, Vahab S. Mirrokni

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973730.70

Mathematics Subject Classification ID

Linear programming (90C05) Convex programming (90C25) Noncooperative games (91A10) Games involving graphs (91A43) General equilibrium theory (91B50)

Recommendations

• Intrinsic robustness of the price of anarchy
• Intrinsic robustness of the price of anarchy
• On the robustness of the approximate price of anarchy in generalized congestion games
• Local smoothness and the price of anarchy in atomic splittable congestion games
• The price of anarchy in large games

Cited in

(9)

• How good is a two-party election game?
• On the robustness of the approximate price of anarchy in generalized congestion games
• FIFO and randomized competitive packet routing games
• Welfare maximization with production costs: a primal dual approach
• Atomic dynamic flow games: adaptive vs. nonadaptive agents
• Game efficiency through linear programming duality
• New bounds for the price of anarchy under nonlinear and asymmetric costs
• Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
• Atomic dynamic routing games with multiple destinations

This page was built for publication: Robust price of anarchy bounds via LP and Fenchel duality

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