Abstract
The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. Informally, a weakly acyclic game is one where natural distributed dynamics, such as better-response dynamics, cannot enter inescapable oscillations. We establish a novel link between such games and the existence of pure Nash equilibria in subgames. Specifically, we show that the existence of a unique pure Nash equilibrium in every subgame implies the weak acyclicity of a game. In contrast, the possible existence of multiple pure Nash equilibria in every subgame is insufficient for weak acyclicity.
Partially supported by the DIMACS Special Focus on Communication Security and Information Privacy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Engelberg, R., Schapira, M.: Hierarchy of Internet routing games, 12 p. (in submission 2010)
Fabrikant, A., Papadimitriou, C.H.: The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. In: Proc. of SODA, pp. 844–853 (2008)
Friedman, J.W., Mezzetti, C.: Learning in games by random sampling. Journal of Economic Theory 98, 55–84 (2001)
Goemans, M., Mirrokni, V., Vetta, A.: Sink equilibria and convergence. In: Proceedings of IEEE FOCS, pp. 142–151 (2005)
Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. 10(2), 232–243 (2002)
Kukushkin, N.S., Takahashi, S., Yamamori, T.: Improvement dynamics in games with strategic complementarities. Intl. J. Game Theory 33(2), 229–238 (2005)
Levin, H., Schapira, M., Zohar, A.: Interdomain routing and games. In: Proceedings of ACM STOC, pp. 57–66 (2008)
Marden, J.R., Young, H.P., Arslan, G., Shamma, J.S.: Payoff-based dynamics in multi-player weakly acyclic games. SIAM J. on Control and Optimization 48, 373–396 (2009)
Marden, J., Arslan, G., Shamma, J.: Connections between cooperative control and potential games illustrated on the consensus problem. In: Proceedings of the European Control Conference (July 2007)
Milchtaich, I.: Congestion games with player-specific payoff functions. GEB 13, 111–124 (1996)
Mirrokni, V.S., Skopalik, A.: On the complexity of nash dynamics and sink equilibria. In: ACM Conference on Electronic Commerce, pp. 1–10 (2009)
Monderer, D., Shapley, L.S.: Potential games. GEB 14, 124–143 (1996)
Moulin, H.: Dominance solvable voting schemes. Econometrica 47, 1337–1351 (1979)
Nisan, N., Schapira, M., Zohar, A.: Asynchronous best-reply dynamics. In: Proceedings of the Workshop on Internet Economics, pp. 531–538 (2008)
Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, 65–67 (1973)
Yamamori, T., Takahashi, S.: The pure Nash equilibrium property and the quasi-acyclic condition. Economics Bulletin 3(22), 1–6 (2002)
Young, H.P.: The evolution of conventions. Econometrica 61(1), 57–84 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fabrikant, A., Jaggard, A.D., Schapira, M. (2010). On the Structure of Weakly Acyclic Games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds) Algorithmic Game Theory. SAGT 2010. Lecture Notes in Computer Science, vol 6386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16170-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-16170-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16169-8
Online ISBN: 978-3-642-16170-4
eBook Packages: Computer ScienceComputer Science (R0)