We study dominant strategy implementation especially in economic environments. We first showthat in general environments, strategy-proofness and quasi-strong-non-bossiness together are necessary and sufficient for dominant strategy implementation via the associated direct revelationmechanism. We...

We study dominant strategy implementation especially in economic environments. We first show that in general environments, strategy-proofness and quasi-strong-non-bossiness together are necessary and sufficient for dominant strategy implementation via the associated direct revelation mechanism....

In this paper, we revisit a long-standing question on the structure of strategy-proof and Pareto-efficient social choice functions (SCFs) in classical exchange economies (Hurwicz (1972)). Using techniques developed by Myerson in the context of auction-design, we show that in a specific...

We investigate implementation of social choice functions with asymmetric information concerning the state from epistemological perspectives. While each agent is either selfish or honest, they do not expect other participants to be honest. Nevertheless, an honest agent may exist, not among the...

Mechanisms that are used to characterize Nash implementable social choice correspondences (SCC) have unattractive features since they have to cover every instances of the implementation problem. This is unavoidable, as there are infinitely many cases, but at the same time it leaves open whether...

We study a social choice model with partially honest agents, and we show that strategy-proofness is a necessary and sufficient condition to achieve secure implementation. This result provides a behavioral foundation for the rectangularity property; and it offers as a by-product a revelation...

A partially-honest individual is a person who follows the maxim, "Do not lie if you do not have to" to serve your material interest. By assuming that the mechanism designer knows that there is at least one partially-honest individual in a society of n≥3 individuals, a social choice rule (SCR)...

This paper studies full implementation problems in (pure and mixed) Nash equilibrium in finite environments. We restrict the designer to adopt<I>finite</I> mechanisms, thus ruling out integer games. We provide a condition, top-<I>D</I> inclusiveness, that together with set-monotonicity is sufficient for mixed...</i></i>

In this paper, we study full implementation problem by mechanisms that allow delay. The delay on the equilibrium path may be zero, infinitesimally small or a fixed positive number. In all these three cases, implementable rules are characterized by a monotonicity-like condition alone, including...

In this paper, we study the Nash implementation in an allocation problem with single-dipped preferences. We show that, with at least three agents, Maskin monotonicity is necessary and sufficient for implementation. We examine the implementability of various social choice correspondences (SCCs)...