Best-reply dynamics in large binary-choice anonymous games
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. Computing Equilibria in Anonymous Games , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[2] Evolutionary Stability for Large Populations , 2003 .
[3] Itai Arieli,et al. Fast Convergence in Population Games , 2011 .
[4] Berthold Vöcking,et al. Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods , 2010, SIAM J. Comput..
[5] Eran Shmaya,et al. Lipschitz Games , 2013, Math. Oper. Res..
[6] Ziv Gorodeisky,et al. Evolutionary Stability for Large Populations and Backward Induction , 2006, Math. Oper. Res..
[7] Yossi Azar,et al. Fast convergence to nearly optimal solutions in potential games , 2008, EC '08.
[8] D. Schmeidler. Equilibrium points of nonatomic games , 1973 .
[9] Yishay Mansour,et al. How long to equilibrium? The communication complexity of uncoupled equilibrium procedures , 2010, Games Econ. Behav..
[10] Berthold Vöcking,et al. On the Evolution of Selfish Routing , 2004, ESA.
[11] Josef Hofbauer,et al. Evolutionary Games and Population Dynamics , 1998 .
[12] William H. Sandholm,et al. Evolution in Bayesian games I: Theory , 2005, Games Econ. Behav..
[13] M. Blonski. Anonymous Games with Binary Actions , 1999 .
[14] P. Hilton,et al. Catalan Numbers, Their Generalization, and Their Uses , 1991 .
[15] S. Rashid. Equilibrium points of non-atomic games : Asymptotic results , 1982 .
[16] Paul R. Milgrom,et al. Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities , 1990 .
[17] M. Benaïm,et al. Deterministic Approximation of Stochastic Evolution in Games , 2003 .