An action is robustly rationalizable if it is rationalizable for every type who has almost common certainty of payoffs. We illustrate by means of an example that an action may not be robustly rationalizable even if it is weakly dominant, and argue that robust rationalizability is a very stringent refinement of rationalizability. Nonetheless, we show that every strictly rationalizable action is robustly rationalizable. We also investigate how permissive robust rationalizability becomes if we require that players be fully certain of their own payoffs.jere_553 57..67 JEL Classification Numbers: C72, D82. 1
Robust virtual implementation asks if a social goal can be approximately achieved if merely the agen...
The introduction of a small amount of bounded rationality into a model sometimes has little effect a...
Suppose that each player in a game is rational, each player thinks the other players are rational, a...
An action is robustly rationalizable if it is rationalizable for every type who has almost common ce...
International audienceAn action is robustly rationalizable if it is rationalizable for every type wh...
Rationalizability is a central concept in game theory. Since there may be many rationalizable strate...
In normal-form games, rationalizability (Bernheim [3], Pearce [11]) on its own fails to exclude some...
Weakly rationalizable implementation represents a generalization of robust implemen-tation to dynami...
Incentive mechanisms that assume agents to be fully rational, may fail due to the bounded rationalit...
This paper investigates the extent to which rationalizable implementation depends on the implicit co...
There exist three equivalent definitions of perfect Nash equilibria which differ in the way "best re...
In this paper I present conditions, not involving common knowledge of rationality, that lead to (cor...
Abstract. We show that in any game that is continuous at in\u85nity, if a plan of action ai is ratio...
We consider the generic robustness of an upper hemi-continuous solution concept on a class of games ...
We introduce an equivalent definition for robust implementation, termed s-rationalizable implementat...
Robust virtual implementation asks if a social goal can be approximately achieved if merely the agen...
The introduction of a small amount of bounded rationality into a model sometimes has little effect a...
Suppose that each player in a game is rational, each player thinks the other players are rational, a...
An action is robustly rationalizable if it is rationalizable for every type who has almost common ce...
International audienceAn action is robustly rationalizable if it is rationalizable for every type wh...
Rationalizability is a central concept in game theory. Since there may be many rationalizable strate...
In normal-form games, rationalizability (Bernheim [3], Pearce [11]) on its own fails to exclude some...
Weakly rationalizable implementation represents a generalization of robust implemen-tation to dynami...
Incentive mechanisms that assume agents to be fully rational, may fail due to the bounded rationalit...
This paper investigates the extent to which rationalizable implementation depends on the implicit co...
There exist three equivalent definitions of perfect Nash equilibria which differ in the way "best re...
In this paper I present conditions, not involving common knowledge of rationality, that lead to (cor...
Abstract. We show that in any game that is continuous at in\u85nity, if a plan of action ai is ratio...
We consider the generic robustness of an upper hemi-continuous solution concept on a class of games ...
We introduce an equivalent definition for robust implementation, termed s-rationalizable implementat...
Robust virtual implementation asks if a social goal can be approximately achieved if merely the agen...
The introduction of a small amount of bounded rationality into a model sometimes has little effect a...
Suppose that each player in a game is rational, each player thinks the other players are rational, a...