The main result of this paper is that the multiple equilibrium problem in mechanism design can be avoided in private value models if agents do not use weakly dominated strategies in equilibrium. We show that in such settings, any incentive compatible allocation can be made the unique equilibrium outcome to a mechanism. We derive a general necessary condition for unique implementation which implies that the positive result for private value models applies with considerably less generality to common value settings and to situations in which an agent's information does not index the agent's preferences
We consider full implementation in abstract complete-information environments when agents have an ar...
In this paper we consider a model in which agents have complete information about their neighbours a...
The field of algorithmic mechanism design is concerned with the design of computationally efficient ...
The main result of this paper is that the multiple equilibrium problem in mechanism design can be av...
The main result of this paper is that the multiple equilibrium problem in mechanism design can be av...
In this paper, we analyze the problem of designing incentive compatible mechanisms in pure exchange ...
It is well known that when players have private information, vis a vis the designer, and their prefe...
We study games in which several principals design incentive schemes in the presence of privately inf...
This paper investigates the problem of designing mechanisms whose Nash allocations coincid...
We show that, in environments with independent private values and transferable utility, a privately...
We construct an elementary mechanism [dutta, b., sen, a., vohra, r., 1995. Nash implementation throu...
I consider the implementation problem under complete information and employ Nash equilibrium as a so...
We construct an elementary mechanism (Dutta, Sen and Vohra (1995)) that Nash implements the Constrai...
We study efficient, Bayes-Nash incentive compatible mechanisms in a social choice setting that allow...
We consider full implementation in abstract complete-information environments when agents have an ar...
In this paper we consider a model in which agents have complete information about their neighbours a...
The field of algorithmic mechanism design is concerned with the design of computationally efficient ...
The main result of this paper is that the multiple equilibrium problem in mechanism design can be av...
The main result of this paper is that the multiple equilibrium problem in mechanism design can be av...
In this paper, we analyze the problem of designing incentive compatible mechanisms in pure exchange ...
It is well known that when players have private information, vis a vis the designer, and their prefe...
We study games in which several principals design incentive schemes in the presence of privately inf...
This paper investigates the problem of designing mechanisms whose Nash allocations coincid...
We show that, in environments with independent private values and transferable utility, a privately...
We construct an elementary mechanism [dutta, b., sen, a., vohra, r., 1995. Nash implementation throu...
I consider the implementation problem under complete information and employ Nash equilibrium as a so...
We construct an elementary mechanism (Dutta, Sen and Vohra (1995)) that Nash implements the Constrai...
We study efficient, Bayes-Nash incentive compatible mechanisms in a social choice setting that allow...
We consider full implementation in abstract complete-information environments when agents have an ar...
In this paper we consider a model in which agents have complete information about their neighbours a...
The field of algorithmic mechanism design is concerned with the design of computationally efficient ...