On the Complexity of Iterated Weak Dominance in Constant-Sum Games
暂无分享,去创建一个
Felix A. Fischer | Felix Brandt | Paul Harrenstein | Markus Brill | F. Brandt | Markus Brill | Paul Harrenstein
[1] Felix A. Fischer,et al. Computing Shapley's saddles , 2009, SECO.
[2] J. Mertens,et al. ON THE STRATEGIC STABILITY OF EQUILIBRIA , 1986 .
[3] Makoto Shimoji,et al. On the equivalence of weak dominance and sequential best response , 2004, Games Econ. Behav..
[4] Eitan Zemel,et al. The Complexity of Eliminating Dominated Strategies , 1993, Math. Oper. Res..
[5] B. Bernheim. Rationalizable Strategic Behavior , 1984 .
[6] H. Keisler,et al. ADMISSIBILITY IN GAMES , 2008 .
[7] H. Raiffa,et al. Games and Decisions: Introduction and Critical Survey. , 1958 .
[8] Krzysztof R. Apt,et al. Uniform Proofs of Order Independence for Various Strategy Elimination Procedures , 2004, ArXiv.
[9] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[10] Jeroen M. Swinkels,et al. Order Independence for Iterated Weak Dominance , 1997, Games Econ. Behav..
[11] Christian Ewerhart,et al. Iterated Weak Dominance in Strictly Competitive Games of Perfect Information , 2002, J. Econ. Theory.
[12] David Pearce. Rationalizable Strategic Behavior and the Problem of Perfection , 1984 .
[13] Vincent Conitzer,et al. Complexity of (iterated) dominance , 2005, EC '05.
[14] Larry Samuelson,et al. Dominated strategies and common knowledge , 1992 .
[15] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[16] Roger B. Myerson,et al. Game theory - Analysis of Conflict , 1991 .
[17] D. Koller,et al. The complexity of two-person zero-sum games in extensive form , 1992 .
[18] Yoav Shoham,et al. Ranking games , 2009, Artif. Intell..