Strong Nash Equilibrium Is in Smoothed P
暂无分享,去创建一个
[1] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[2] Tuomas Sandholm,et al. On the verification and computation of strong nash equilibrium , 2013, AAMAS.
[3] Guoqiang Tian,et al. On the existence of strong Nash equilibria , 2014 .
[4] Martin Hoefer,et al. On the Complexity of Pareto-Optimal Nash and Strong Equilibria , 2012, Theory of Computing Systems.
[5] Kim Fung Man,et al. Multiobjective Optimization , 2011, IEEE Microwave Magazine.
[6] Xi Chen,et al. Computing Nash Equilibria: Approximation and Smoothed Complexity , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[7] Xiaotie Deng,et al. Settling the complexity of computing two-player Nash equilibria , 2007, JACM.
[8] Tuomas Sandholm,et al. Algorithms for Strong Nash Equilibrium with More than Two Agents , 2013, AAAI.
[9] Moshe Tennenholtz,et al. Strong and Correlated Strong Equilibria in Monotone Congestion Games , 2006, WINE.
[10] R. Aumann. Acceptable points in games of perfect information. , 1960 .
[11] O. Rozenfeld. Strong Equilibrium in Congestion Games , 2007 .
[12] Jérôme Monnot,et al. On Strong Equilibria in the Max Cut Game , 2009, WINE.
[13] Yishay Mansour,et al. Strong equilibrium in cost sharing connection games , 2007, EC '07.
[14] Vincent Conitzer,et al. New complexity results about Nash equilibria , 2008, Games Econ. Behav..
[15] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[16] Éva Tardos,et al. The effect of collusion in congestion games , 2006, STOC '06.