We consider a connection networks model. Every agent has a demand in the form of pairs of locations she wants connected, and a willingness to pay for connectivity. A planner aims at implementing a welfare maximizing network and allocating the resulting cost, but information is asymmetric: agents...

Abstract: In this paper we explore the problem of Nash implementation providing new sufficient conditions called I-monotonicity and I-weak no-veto power. Firstly, we show that these conditions together with unanimity are sufficient for the implementation of social choice correspondences (SCCs)...

This paper studies implementation problems in the wake of a recent trend of implementation of non-consequentialist nature, which draws on the evidence taken from experimental and behavioral economics. Specifically, following the seminal works by Matsushima (2008) and Dutta and Sen (2009), the...

In this paper, we give a sufficient condition for double implementation in Nash and M-Nash equilibria. Furthermore, we discuss the mechanism with transfers and prove that some important social choice rules are doubly implemented in Nash and M-Nash equilibria by the mechanism with transfers.

This paper studies implementation problems in the wake of a recent trend of implementation of non-consequentialist nature, which draws on the evidence taken from experimental and behavioral economics. Specifically, following the seminal works by Matsushima (2008) and Dutta and Sen (2009), the...

An agent is said to be partially honest if he or she weakly prefers an outcome at a strategy profile with his truthful strategy than an outcome at a strategy profile with his false strategy, then this player must prefer strictly the \true" strategy profille to the \false" strategy profile. In...

This paper studies implementation problems in the wake of a recent new trend of implementation theory which incorporates a non-consequentialist flavor of the evidence from experimental and behavioral economics into the issues. Specifically, following the seminal works by Matsushima (2008) and...

Noting that a full characterization of Nash-implementation is given using a canonical-mechanism and Maskin’s theorem (Maskin, 1999) is shown using a mechanism with Saijo’s type of strategy space reduction (Saijo, 1988), this paper fully characterizes the class of Nashimplementable social...

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)...

This paper investigates the robustness of Dutta and Sen's (2012) Theorem 1 to weaker notions of truth-telling. An individual honesty standard is modeled as a subgroup of the society, including the individual herself, for which she feels truth-telling concerns. An individual i is honest when she...