The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond

We settle the complexity of a well-known problem in networking by establishing that it is PSPACE-complete to tell whether a system of path preferences in the BGP protocol [25] can lead to oscillatory behavior; one key insight is that the BGP oscillation question is in fact one about Nash dynamics. We also show that the concept of sink equilibria proposed recently in [11] is PSPACE-complete to analyze and approximate for graphical games. Finally, we propose a new equilibrium concept inspired by game dynamics, unit recall equilibria, which we show to be close to universal (exists with high probability in a random game) and algorithmically promising. We also give a relaxation thereof, called componentwise unit recall equilibria, which we show to be both tractable and universal (guaranteed to exist in every game).

[1]  Paul W. Goldberg,et al.  The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..

[2]  Eric J. Friedman,et al.  Learning and Implementation on the Internet , 1997 .

[3]  Xi Chen,et al.  Computing Nash Equilibria: Approximation and Smoothed Complexity , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[4]  Panagiota N. Panagopoulou,et al.  Polynomial algorithms for approximating Nash equilibria of bimatrix games , 2006, Theor. Comput. Sci..

[5]  John W. Stewart,et al.  BGP4 : inter-domain routing in the Internet , 1998 .

[6]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[7]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[8]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[9]  A. J. Goldman,et al.  The probability of an equilibrium point , 1968 .

[10]  A. Neyman.  Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma , 1985 .

[11]  Peter Stone,et al.  A polynomial-time nash equilibrium algorithm for repeated games , 2003, EC '03.

[12]  Christos H. Papadimitriou,et al.  Computing correlated equilibria in multi-player games , 2005, STOC '05.

[13]  Gordon T. Wilfong,et al.  The stable paths problem and interdomain routing , 2002, TNET.

[14]  R. Aumann.  Subjectivity and Correlation in Randomized Strategies , 1974 .

[15]  Farnam Jahanian,et al.  Internet routing instability , 1997, SIGCOMM '97.

[16]  Aranyak Mehta,et al.  Playing large games using simple strategies , 2003, EC '03.

[17]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[18]  Mihalis Yannakakis,et al.  On complexity as bounded rationality (extended abstract) , 1994, STOC '94.

[19]  Aranyak Mehta,et al.  A Note on Approximate Nash Equilibria , 2006, WINE.

[20]  Vahab S. Mirrokni,et al.  Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[21]  Daniel Walton,et al.  BGP Persistent Route Oscillation Condition , 2001 .

[22]  R. Aumann.  Survey of Repeated Games , 1981 .

[23]  Christos H. Papadimitriou,et al.  The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies , 2006, ICALP.

[24]  Gordon T. Wilfong,et al.  An analysis of BGP convergence properties , 1999, SIGCOMM '99.

[25]  Adam Tauman Kalai,et al.  An Approach to Bounded Rationality , 2006, NIPS.

[26]  Sylvain Sorin,et al.  Cooperation Through Repetition: Complete Information , 1997 .

[27]  Deborah Estrin,et al.  Persistent route oscillations in inter-domain routing , 2000, Comput. Networks.