Artemov, Kunimoto, and Serrano (2009) show that, in quasilinear envi-ronments with incomplete information where interim preferences of types are diverse, any incentive compatible social choice function is robustly virtually im-plementable in iteratively undominated strategies. This paper offers two main results: First, I restrict attention to complete information and show that when there are at least three agents, any social choice function is robustly virtually implementable. This is a robust analogue of Abreu and Matsushima (1992a) that only applies to “non-robust ” environments, i.e., complete information. Therefore, I also show that robust virtual implementation is unchanged even under “almost ” complete information.
We investigate implementation of social choice functions that map from states to lotteries and may d...
In this paper we consider a model in which agents have complete information about their neighbours a...
It is well-known that mechanism design literature makes many simplifying infor- mational assumptions...
Artemov, Kunimoto, and Serrano (2009) show that, in quasilinear environ-ments with incomplete inform...
We consider robust virtual implementation, where robustness is the requirement that implementation s...
We consider robust virtual implementation, where robustness is the requirement that implementation s...
[This item is a preserved copy. To view the original, visit http://econtheory.org/] In a ...
In situations in which the social planner has to make several decisions over time, before agents hav...
In a general interdependent preference environment, we characterize when two payoff types can be dist...
A social choice function is robustly implemented if every equilibrium on every type space achieves o...
Bergemann and Morris (2009b) show that static mechanisms cannot robustly virtually implement noncons...
A social choice function is robustly implemented if every equilibrium on every type space achieves o...
We consider the implementation of social choice functions under complete information in rationalizab...
A social choice function is robustly implemented if every equilibrium on every type space achieves o...
A social choice function is robustly implementable if there is a mechanism under which the process o...
We investigate implementation of social choice functions that map from states to lotteries and may d...
In this paper we consider a model in which agents have complete information about their neighbours a...
It is well-known that mechanism design literature makes many simplifying infor- mational assumptions...
Artemov, Kunimoto, and Serrano (2009) show that, in quasilinear environ-ments with incomplete inform...
We consider robust virtual implementation, where robustness is the requirement that implementation s...
We consider robust virtual implementation, where robustness is the requirement that implementation s...
[This item is a preserved copy. To view the original, visit http://econtheory.org/] In a ...
In situations in which the social planner has to make several decisions over time, before agents hav...
In a general interdependent preference environment, we characterize when two payoff types can be dist...
A social choice function is robustly implemented if every equilibrium on every type space achieves o...
Bergemann and Morris (2009b) show that static mechanisms cannot robustly virtually implement noncons...
A social choice function is robustly implemented if every equilibrium on every type space achieves o...
We consider the implementation of social choice functions under complete information in rationalizab...
A social choice function is robustly implemented if every equilibrium on every type space achieves o...
A social choice function is robustly implementable if there is a mechanism under which the process o...
We investigate implementation of social choice functions that map from states to lotteries and may d...
In this paper we consider a model in which agents have complete information about their neighbours a...
It is well-known that mechanism design literature makes many simplifying infor- mational assumptions...