Iterated Weak Dominance in Strictly Competitive Games of Perfect Information
暂无分享,去创建一个
[1] H. Moulin. The strategy of social choice , 1983 .
[2] D Gale,et al. A Theory of N-Person Games with Perfect Information. , 1953, Proceedings of the National Academy of Sciences of the United States of America.
[3] H. Moulin. Dominance Solvable Voting Schemes , 1979 .
[4] R. J. Gretlein,et al. Dominance elimination procedures on finite alternative games , 1983 .
[5] H. Moulin. Game theory for the social sciences , 1982 .
[6] J. Neumann,et al. Theory of games and economic behavior , 1945, 100 Years of Math Milestones.
[7] Gretlein Rodney J,et al. DOMINANCE SOLVABLE VOTING SCHEMES: A COMMENT , 1982 .
[8] R. Rosenthal. Games of perfect information, predatory pricing and the chain-store paradox , 1981 .
[9] Christian Ewerhart,et al. Chess-like Games Are Dominance Solvable in at Most Two Steps , 2000, Games Econ. Behav..
[10] Ken Binmore,et al. Fun and games : a text on game theory , 1991 .
[11] Pierpaolo Battigalli,et al. On Rationalizability in Extensive Games , 1997 .