Proper rationalizability in lexicographic beliefs

Proper rationalizability in lexicographic beliefs

0.00 Avg rating0 Votes
Article ID: iaor2003681
Country: Germany
Volume: 30
Issue: 4
Start Page Number: 453
End Page Number: 478
Publication Date: Jan 2001
Journal: International Journal of Game Theory
Authors:
Abstract:

Proper consistency is defined by the property that each player takes all opponent strategies into account (is cautious) and deems one opponent strategy to be infinitely more likely than another if the opponent prefers the one to the other (respects preferences). When there is common certain belief of proper consistency, a most preferred strategy is properly rationalizable. Any strategy used with positive probability in a proper equilibrium is properly rationalizable. Only strategies that lead to the backward induction outcome are properly rationalizable in the strategic form of a generic perfect information game. Proper rationalizability can test the robustness of inductive procedures.

Reviews

Required fields are marked *. Your email address will not be published.