Algorithms for Rationalizability and CURB Sets
暂无分享,去创建一个
[1] J. Weibull,et al. Strategy subsets closed under rational behavior , 1991 .
[2] Andrew McLennan,et al. Gambit: Software Tools for Game Theory , 2006 .
[3] 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).
[4] David Pearce. Rationalizable Strategic Behavior and the Problem of Perfection , 1984 .
[5] Yinyu Ye,et al. Improved complexity results on solving real-number linear feasibility problems , 2006, Math. Program..
[6] Eitan Zemel,et al. The Complexity of Eliminating Dominated Strategies , 1993, Math. Oper. Res..
[7] D. Knuth,et al. A note on strategy elimination in bimatrix games , 1988 .
[8] Yoav Shoham,et al. Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..
[9] Pierpaolo Battigalli,et al. Rationalizable bidding in first-price auctions , 2003, Games Econ. Behav..
[10] Vincent Conitzer,et al. Mixed-Integer Programming Methods for Finding Nash Equilibria , 2005, AAAI.
[11] Henk Norde,et al. An Axiomatization of Minimal Curb Sets , 2005, Int. J. Game Theory.
[12] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[13] Vitaly Pruzhansky,et al. On finding curb sets in extensive games , 2003, Int. J. Game Theory.
[14] Henk Norde,et al. An axiomatization of minimal curb sets , 2005, Int. J. Game Theory.
[15] Yoav Shoham,et al. Simple search methods for finding a Nash equilibrium , 2004, Games Econ. Behav..
[16] B. Bernheim. Rationalizable Strategic Behavior , 1984 .
[17] In-Koo Cho,et al. Monotonicity and Rationalizability in a Large First Price Auction , 2005 .
[18] Noam Nisan,et al. Online ascending auctions for gradually expiring items , 2005, SODA '05.
[19] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[20] Vincent Conitzer,et al. Complexity of (iterated) dominance , 2005, EC '05.
[21] Eitan Zemel,et al. Nash and correlated equilibria: Some complexity considerations , 1989 .
[22] Bernhard von Stengel,et al. Exponentially many steps for finding a Nash equilibrium in a bimatrix game , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[23] Vincent Conitzer,et al. A technique for reducing normal-form games to compute a Nash equilibrium , 2006, AAMAS '06.
[24] Sjaak Hurkens. Learning by Forgetful Players: From Primitive Formations to Persistent Retracts , 1994 .
[25] Eddie Dekel,et al. Rationalizable Outcomes of Large Independent Private-Value First-Price Discrete Auctions , 2000 .
[26] Daniel M. Kane,et al. On the complexity of two-player win-lose games , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[27] 김여근. 쌍행렬게임의 평형점 ( Equilibrium Points of Bimatrix Games : A State-of-the-Art ) , 1982 .
[28] Vincent Conitzer,et al. A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It , 2005, AAAI.