On the Complexity of Nash Equilibrium Reoptimization
暂无分享,去创建一个
[1] Aranyak Mehta,et al. A note on approximate Nash equilibria , 2006, Theor. Comput. Sci..
[2] M. Dufwenberg. Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.
[3] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Paul G. Spirakis,et al. An Optimization Approach for Approximate Nash Equilibria , 2007, WINE.
[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] Eitan Zemel,et al. Nash and correlated equilibria: Some complexity considerations , 1989 .
[8] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[9] Paul W. Goldberg,et al. The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..
[10] Christos H. Papadimitriou,et al. On Total Functions, Existence Theorems and Computational Complexity , 1991, Theor. Comput. Sci..
[11] Amos Azaria,et al. Analyzing the Effectiveness of Adversary Modeling in Security Games , 2013, AAAI.
[12] Nicola Gatti,et al. Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm , 2008, Artif. Intell..
[13] Aranyak Mehta,et al. Playing large games using simple strategies , 2003, EC '03.
[14] Luca Bertazzi,et al. Reoptimizing the traveling salesman problem , 2003, Networks.
[15] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[16] Vincent Conitzer,et al. New complexity results about Nash equilibria , 2008, Games Econ. Behav..
[17] Milind Tambe,et al. Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .
[18] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[19] Aranyak Mehta,et al. Progress in approximate nash equilibria , 2007, EC '07.
[20] Markus W. Schäffter,et al. Scheduling with Forbidden Sets , 1997, Discret. Appl. Math..
[21] Kousha Etessami,et al. On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..
[22] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[23] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[24] Eric van Damme,et al. Non-Cooperative Games , 2000 .
[25] Paul G. Spirakis,et al. Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games , 2007, ICALP.
[26] Aranyak Mehta,et al. A Note on Approximate Nash Equilibria , 2006, WINE.
[27] 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).