Robust Price of Anarchy Bounds via LP and Fenchel Duality
From MaRDI portal
Publication:5363045
DOI10.1137/1.9781611973730.70zbMath1372.91016MaRDI QIDQ5363045
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
90C25: Convex programming
91A10: Noncooperative games
90C05: Linear programming
91A43: Games involving graphs
91B50: General equilibrium theory
Related Items
Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents, Game efficiency through linear programming duality, 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