Computational aspects of Shapley's saddles
暂无分享,去创建一个
Felix A. Fischer | Felix Brandt | Paul Harrenstein | Markus Brill | F. Brandt | Markus Brill | Paul Harrenstein
[1] J. Weibull,et al. Strategy subsets closed under rational behavior , 1991 .
[2] S. Vajda,et al. GAMES AND DECISIONS; INTRODUCTION AND CRITICAL SURVEY. , 1958 .
[3] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.
[4] 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).
[5] D. Knuth,et al. A note on strategy elimination in bimatrix games , 1988 .
[6] Felix A. Fischer,et al. Computational Aspects of Covering in Dominance Graphs , 2007, AAAI.
[7] S. Vajda. Some topics in two-person games , 1971 .
[8] John Duggan,et al. Dutta's Minimal Covering Set and Shapley's Saddles , 1996 .
[9] Vincent Conitzer,et al. A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It , 2005, AAAI.
[10] Bhaskar Dutta,et al. Comparison functions and choice correspondences , 1999 .
[11] John Duggan,et al. Mixed refinements of Shapley's saddles and weak tournaments , 2001, Soc. Choice Welf..
[12] J. Harsanyi. Oddness of the number of equilibrium points: A new proof , 1973 .
[13] Vincent Conitzer,et al. Complexity of (iterated) dominance , 2005, EC '05.
[14] Tuomas Sandholm,et al. Algorithms for Rationalizability and CURB Sets , 2006, AAAI.
[15] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[16] Felix A. Fischer,et al. On the Hardness and Existence of Quasi-Strict Equilibria , 2008, SAGT.
[17] Felix A. Fischer,et al. Computing the minimal covering set , 2008, Math. Soc. Sci..
[18] Andrew McLennan,et al. Simple complexity from imitation games , 2010, Games Econ. Behav..
[19] Eric van Damme,et al. Non-Cooperative Games , 2000 .
[20] M. Dufwenberg. Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.
[21] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[22] Yoav Shoham,et al. On Strictly Competitive Multi-Player Games , 2006, AAAI.