The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds
We show a formal duality between certain equilibrium concepts, including the correlated and coarse correlated equilibrium, and analysis frameworks for proving bounds on the price of anarchy for such concepts. Our first application of this duality is a characterization of the set of distributions over game outcomes to which “smoothness bounds” always apply. This set is a natural and strict generalization of the coarse correlated equilibria of the game. Second, we derive a refined definition of smoothness that is specifically tailored for coarse correlated equilibria and can be used to give improved POA bounds for such equilibria.
KeywordsNash Equilibrium Equilibrium Concept Congestion Game Correlate Equilibrium Mixed Nash Equilibrium
Unable to display preview. Download preview PDF.
- 2.Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games. In: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 45–52 (2006)Google Scholar
- 3.Blum, A., Hajiaghayi, M., Ligett, K., Roth, A.: Regret minimization and the price of total anarchy. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 373–382 (2008)Google Scholar
- 7.Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 604–612 (2004)Google Scholar
- 8.Hannan, J.: Approximation to Bayes risk in repeated plays. In: Dresher, M., Tucker, A., Wolfe, P. (eds.) Contributions to the Theory of Games, vol. 3, pp. 97–139. Princeton University Press, Princeton (1957)Google Scholar
- 11.Roughgarden, T.: Intrinsic robustness of the price of anarchy. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 513–522 (2009)Google Scholar
- 12.Vetta, A.: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 416–425 (2002)Google Scholar