Approximate Nash Equilibria with Near Optimal Social Welfare
暂无分享,去创建一个
[1] Aranyak Mehta,et al. A note on approximate Nash equilibria , 2006, Theor. Comput. Sci..
[2] Xiaotie Deng,et al. Settling the complexity of computing two-player Nash equilibria , 2007, JACM.
[3] Panagiota N. Panagopoulou,et al. Polynomial algorithms for approximating Nash equilibria of bimatrix games , 2006, Theor. Comput. Sci..
[4] Amin Saberi,et al. Approximating nash equilibria using small-support strategies , 2007, EC '07.
[5] Eric van Damme,et al. Non-Cooperative Games , 2000 .
[6] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[7] I. Althöfer. On sparse approximations to randomized strategies and convex combinations , 1994 .
[8] Robert Krauthgamer,et al. How hard is it to approximate the best Nash equilibrium? , 2009, SODA.
[9] Paul G. Spirakis,et al. An Optimization Approach for Approximate Nash Equilibria , 2007, WINE.
[10] Eitan Zemel,et al. Nash and correlated equilibria: Some complexity considerations , 1989 .
[11] Evangelos Markakis,et al. New algorithms for approximate Nash equilibria in bimatrix games , 2010, Theor. Comput. Sci..
[12] Mark Braverman,et al. Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis , 2015, Electron. Colloquium Comput. Complex..
[13] Aranyak Mehta,et al. Playing large games using simple strategies , 2003, EC '03.
[14] Mark Braverman,et al. Inapproximability of NP-Complete Variants of Nash Equilibrium , 2011, Theory Comput..
[15] Dan Vilenchik,et al. Small Clique Detection and Approximate Nash Equilibria , 2009, APPROX-RANDOM.
[16] Constantinos Daskalakis,et al. On the complexity of approximating a Nash equilibrium , 2011, SODA '11.
[17] Vincent Conitzer,et al. New complexity results about Nash equilibria , 2008, Games Econ. Behav..
[18] Aranyak Mehta,et al. Progress in approximate nash equilibria , 2007, EC '07.