Rationalizability
Rationalizability is a solution concept in game theory. The general idea is to provide the weakest constraints on players while still requiring that players are rational and this rationality is common knowledge among the players. It is more permissive than Nash equilibrium. Both require that players respond optimally to some belief about their opponents' actions, but Nash equilibrium requires that these beliefs be correct while rationalizability does not. Rationalizability was first defined, independently, by Bernheim (1984) and Pearce (1984).
Rationalizability | |
---|---|
A solution concept in game theory | |
Relationship | |
Superset of | Nash equilibrium |
Significance | |
Proposed by | D. Bernheim and D. Pearce |
Example | Matching pennies |
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.