论文信息 - Lexicographic rationalizability and iterated admissibility - 字舞流文

Lexicographic rationalizability and iterated admissibility

Abstract Using lexicographic probability systems, we define the concept of ‘lexicographic rationalizability’ and show it to coincide with iterated admissibility (i.e. the iterated elimination of weakly-dominated strategies).

Dale O. Stahl | D. Stahl

[1] T. Tan,et al. The Bayesian foundations of solution concepts of games , 1988 .

[2] H. Moulin. Game theory for the social sciences , 1982 .

[3] Partha Dasgupta,et al. Economic Analysis of Markets and Games , 1992 .

[4] B. Bernheim. Rationalizable Strategic Behavior , 1984 .

[5] Eddie Dekel,et al. Lexicographic Probabilities and Choice Under Uncertainty , 1991 .

[6] Eitan Zemel,et al. On the order of eliminating dominated strategies , 1990 .

[7] Adam Brandenburger,et al. Knowledge and Equilibrium in Games , 1992 .

[8] David Pearce. Rationalizable Strategic Behavior and the Problem of Perfection , 1984 .

[9] D. Fudenberg,et al. Rational Behavior with Payoff Uncertainty , 1990 .

[10] Larry Samuelson,et al. Dominated strategies and common knowledge , 1992 .

[11] Eddie Dekel,et al. Lexicographic Probabilities and Equilibrium Refinements , 1991 .