Open AccessPosted Content
Efficient Repeated Implementation
Jihong Lee,Hamid Sabourian +1 more
25
TL;DR: It is shown that in the complete information environment an SCF is repeated-implementable if and only if it is effcient, and the incomplete information analysis can be extended to incorporate the notion of ex post equilibrium.
read more
Abstract: This paper examines repeated implementation of a social choice function (SCF) with infinitely-lived agents whose preferences are determined randomly in each period. An SCF is repeated-implementable in (Bayesian) Nash equilibrium if there exists a sequence of (possibly history-dependent) mechanisms such that (i) its equilibrium set is non-empty and (ii) every equilibrium outcome corresponds to the desired social choice at every possible history of past play and realizations of uncer- tainty. We first show, with minor qualifications, that in the complete information environment an SCF is repeated-implementable if and only if it is effcient. We then extend this result to the incomplete information setup. In particular, it is shown that in this case efficiency is sufficient to ensure the characterization part of repeated implementation. For the existence part, incentive compatibility is sufficient but not necessary. In the case of interdependent values, existence can also be established with an intuitive condition stipulating that deviations can be detected by at least one agent other than the deviator. Our incomplete information analysis can be extended to incorporate the notion of ex post equilibrium.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Collusion in Auctions with Constrained Bids: Theory and Evidence from Public Procurement
Sylvain Chassang,Juan Ortner +1 more
TL;DR: In this paper, the authors study the mechanics of cartel enforcement and its interaction with bidding constraints in the context of repeated procurement auctions and find considerable evidence that collusion is weakened by the introduction of minimum prices.
Repeated Nash implementation
Claudio Mezzetti,Ludovic Renou +1 more
TL;DR: In this paper, the repeated implementation of social choice functions in environments with complete information and changing preferences is studied, and it is shown that dynamic monotonicity is necessary and almost sufficient for repeated Nash implementation, regardless of whether the horizon is finite or infinite and whether the discount factor is large or small.
•Posted Content
Maskin Meets Abreu and Matsushima
TL;DR: This article showed that Maskin monotonicity is a necessary and sufficient condition for (exact) mixed-strategy Nash implementation by a finite mechanism with no integer or modulo game.
17
Partially Honest Nash Implementation: A Full Charcterization
Michele Lombardi,Naoki Yoshihara +1 more
TL;DR: In this article, a characterization of Nash implementation with partially-honest agents when there are three or more participants is presented. But the characterization is restricted to the case where there are two or more agents.
9
Approximate Implementation in Markovian Environments
Ludovic Renou,Tristan Tomala +1 more
TL;DR: In this article, a social choice function is approximately implementable if there exists a dynamic mechanism such that the social choice functions is implemented by an arbitrary large number of times with arbitrary high probability in every communication equilibrium.
8
References
Nash Equilibrium and Welfare Optimality
TL;DR: In this paper, it was shown that any social choice rule that satisfies monotonicity and no veto power can be implemented by a game form if there are three or more individuals.
1.3K
•Book
Repeated Games and Reputations: Long-Run Relationships
George J. Mailath,Larry Samuelson +1 more
- 28 Sep 2006
TL;DR: In this article, repeated games and reputation are studied in the context of private monitoring games and games of perfect and imperfect public monitoring, with the benefit of modern analytical tools of decomposability and self-generation.
The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility
TL;DR: In this paper, the authors consider the problem of incentive compatibility for social choice rules in a general setting, where the characteristics of individual agents are not known by the planner a priori.
Virtual Implementation in Iteratively Undominated Strategies: Complete Information
Dilip Abreu,Hitoshi Matsushima +1 more
TL;DR: In this paper, the authors investigate the implementation of social choice functions that map to lotteries over alternatives, and they show that if there are three or more players, any social choice function may be so implemented.
330