Assessment 
Biopsychology 
Comparative 
Cognitive 
Developmental 
Language 
Individual differences 
Personality 
Philosophy 
Social 
Methods 
Statistics 
Clinical 
Educational 
Industrial 
Professional items 
World psychology 
Cognitive Psychology: Attention · Decision making · Learning · Judgement · Memory · Motivation · Perception · Reasoning · Thinking  Cognitive processes Cognition  Outline Index

In game theory, rationalizability or rationalizable equilibria is a solution concept which generalizes Nash equilibrium. The general idea is to provide the weakest constraints on players while still requiring rational players. It was first discovered independently by Bernheim (1984) and Pearce (1984).
Constraints on beliefs Edit
A  B  

a  1, 1  0, 0 
b  0, 0  1, 1 
Consider a simple coordination game (the payoff matrix is to the right). The row player can play a if she can reasonably believe that the column player could play A, since a is a best response to A. She can reasonably believe that the column player can play A if it is reasonable for column to believe that the row player could play a. He can believe that she will play a if it is reasonable for him to believe that she could play a, etc.
C  D  

c  2, 2  0, 3 
d  3, 0  1, 1 
This provides an infinite chain of consistent beliefs that result in the players playing (a, A). This makes (a, A) a rationalizable equilibrium. A similar process can be repeated for (b, B).
Not every strategy in every game is rationalizable. Consider a prisoner's dilemma pictured to the left. Row player would never play c, since c is not a best response to any strategy by the column player. This is an example of a more general fact, that a strategy which is strictly dominated cannot be part of a rationalizable equilibrium.
Conversely, for twoplayer games, the set of all rationalizable strategies can be found by iterated elimination of strictly dominated strategies. In games with more than two players, however, there may be strategies that are not strictly dominated, but which can never be the best response. By the iterated elimination of all such strategies one can find the rationalizable strategies for a multiplayer game.
Rationalizability and Nash equilibria Edit
It can be easily proved that every Nash equilibria is a rationalizable equilibria, however the converse is not true. Some rationalizable equilibria are not Nash equilibria. This makes the rationalizability concept a generalization of Nash equilibrium concept.
H  T  

h  1, 1  1, 1 
t  1, 1  1, 1 
As an example, consider the game matching pennies pictured to the right. In this game the only Nash equilibrium is row playing h and t with equal probability and column playing H and T with equal probability. However, all the pure strategies in this game are rationalizable.
Consider the following reasoning: row can play h if it is reasonable for her to believe that column will play H. Column can play H if its reasonable for him to believe that row will play t. Row can play t if its reasonable for her to believe that column will play T. Column can play T if it reasonable for him to believe that row will play h (beginning the cycle again). This provides an infinite set of consistent beliefs that results in row playing h. A similar argument can be given for row playing t, and for column playing either H or T.
References Edit
 Bernheim, D. (1984) Rationalizable Strategic Behavior. Econometrica 52: 10071028.
 Fudenberg, Drew and Jean Tirole (1993) Game Theory. Cambridge: MIT Press.
 Pearce, D. (1984) Rationalizable Strategic Behavior and the Problem of Perfection. Econometrica 52: 10291050.
 Ratcliff, J. (1992–1997) lecture notes on game theory, §2.2: "Iterated Dominance and Rationalizability"
This page uses Creative Commons Licensed content from Wikipedia (view authors). 