On the equilibria of alternating move games
暂无分享,去创建一个
Adam Tauman Kalai | Maria-Florina Balcan | Yishay Mansour | Aaron Roth | Y. Mansour | Aaron Roth | Maria-Florina Balcan | A. Kalai | M. Balcan
[1] A. J. Goldman,et al. The probability of an equilibrium point , 1968 .
[2] H. Moulin. Extensions of two person zero sum games , 1976 .
[3] Richard M. Karp,et al. A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..
[4] A. Ehrenfeucht,et al. Positional strategies for mean payoff games , 1979 .
[5] V. Gurvich. COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: A stochastic game with complete information and without equilibrium situations in pure stationary strategies , 1988 .
[6] A. Karzanov,et al. Cyclic games and an algorithm to find minimax cycle means in directed graphs , 1990 .
[7] V. Gurvich. COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games , 1990 .
[8] Uri Zwick,et al. The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..
[9] Aranyak Mehta,et al. Playing large games using simple strategies , 2003, EC '03.
[10] Henrik Björklund,et al. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discret. Appl. Math..
[11] Vahab S. Mirrokni,et al. Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[12] Daniel M. Kane,et al. On the complexity of two-player win-lose games , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[13] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[14] Adam Tauman Kalai,et al. The myth of the folk theorem , 2008, Games Econ. Behav..
[15] Santosh S. Vempala,et al. Nash equilibria in random games , 2007, Random Struct. Algorithms.
[16] Paul G. Spirakis,et al. An Optimization Approach for Approximate Nash Equilibria , 2007, WINE.
[17] Aranyak Mehta,et al. Progress in approximate nash equilibria , 2007, EC '07.
[18] Benjamin Edelman,et al. Strategic bidder behavior in sponsored search auctions , 2007, Decis. Support Syst..
[19] Yossi Azar,et al. Fast convergence to nearly optimal solutions in potential games , 2008, EC '08.
[20] Christos H. Papadimitriou,et al. The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond , 2008, SODA '08.
[21] Berthold Vöcking,et al. Inapproximability of pure nash equilibria , 2008, STOC.
[22] Paul W. Goldberg,et al. Approximate Equilibria in Games with Few Players , 2008, ArXiv.
[23] Evangelos Markakis,et al. New algorithms for approximate Nash equilibria in bimatrix games , 2010, Theor. Comput. Sci..
[24] T. Roughgarden. Intrinsic robustness of the price of anarchy , 2012, Commun. ACM.