Robust Price of Anarchy Bounds via LP and Fenchel Duality
From MaRDI portal
Publication:5363045
DOI10.1137/1.9781611973730.70zbMATH Open1372.91016OpenAlexW4240466343MaRDI QIDQ5363045FDOQ5363045
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
Convex programming (90C25) Linear programming (90C05) Noncooperative games (91A10) Games involving graphs (91A43) General equilibrium theory (91B50)
Cited In (8)
- Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents
- Game efficiency through linear programming duality
- How good is a two-party election game?
- Welfare maximization with production costs: a primal dual approach
- On the robustness of the approximate price of anarchy in generalized congestion games
- New bounds for the price of anarchy under nonlinear and asymmetric costs
- FIFO and randomized competitive packet routing games
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
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)
