New algorithms for approximate Nash equilibria in bimatrix games
暂无分享,去创建一个
[1] Paul G. Spirakis,et al. Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games , 2007, ICALP.
[2] Panagiota N. Panagopoulou,et al. Polynomial algorithms for approximating Nash equilibria of bimatrix games , 2006, Theor. Comput. Sci..
[3] Amin Saberi,et al. Approximating nash equilibria using small-support strategies , 2007, EC '07.
[4] Aranyak Mehta,et al. A note on approximate Nash equilibria , 2006, Theor. Comput. Sci..
[5] Aranyak Mehta,et al. Progress in approximate nash equilibria , 2007, EC '07.
[6] Evangelos Markakis,et al. New algorithms for approximate Nash equilibria in bimatrix games , 2007, Theor. Comput. Sci..
[7] Eric van Damme,et al. Non-Cooperative Games , 2000 .
[8] I. Althöfer. On sparse approximations to randomized strategies and convex combinations , 1994 .
[9] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[10] Kousha Etessami,et al. On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract) , 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[11] Paul G. Spirakis,et al. Approximate Equilibria for Strategic Two Person Games , 2008, SAGT.
[12] Aranyak Mehta,et al. Playing large games using simple strategies , 2003, EC '03.
[13] Kousha Etessami,et al. On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..
[14] 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).
[15] Paul G. Spirakis,et al. An Optimization Approach for Approximate Nash Equilibria , 2007, WINE.
[16] Xi Chen,et al. Computing Nash Equilibria: Approximation and Smoothed Complexity , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[17] Paul W. Goldberg,et al. Reducibility among equilibrium problems , 2006, STOC '06.