Given the framework introduced by Dutta and Sen (2012), this paper offers a comprehensive analysis of (Nash) implementation with partially honest agents when there are three or more participants. First, it establishes a condition which is necessary and sufficient for implementation. Second, it...

Given the framework introduced by Dutta and Sen (2012), this paper offers a comprehensive analysis of (Nash) implementation with artially honest agents when there are three or more participants. First, it establishes a condition which is necessary and sufficient for implementation. Second, it...

Given the framework introduced by Dutta and Sen (2012), this paper offers a comprehensive analysis of (Nash) implementation with partially honest agents when there are three or more participants. First, it establishes a condition which is necessary and sufficient for implementation. Second, it...

We study non cooperative household models with two agents and several voluntarily contributed public goods, deriving the counterpart to the Slutsky matrix and demonstrating the nature of the deviation of its properties from those of a true Slutsky matrix in the unitary model. We provide results...

The theory of learning in games explores how, which, and what kind of equilibria might arise as a consequence of a long-run nonequilibrium process of learning, adaptation, and/or imitation. If agents’ strategies are completely observed at the end of each round (and agents are randomly matched...

In this paper, we introduce the weak and the strong notions of partially honest agents (Dutta and Sen, 2012), and then study implementation by natural price-quantity mechanisms (Saijo et al., 1996, 1999) in pure exchange economies with three or more agents in which pure-consequentialistically...

We show that Nash equilibrium components are universal for the collection of connected polyhedral sets. More precisely for every polyhedral set we construct a so-called binary game—a game where all players have two pure strategies and a common utility function with values either zero or...

In this paper, we introduce the weak and the strong notions of partially honest agents (Dutta and Sen, 2012), and then study implementation by natural price-quantity mechanisms (Saijo et al., 1996, 1999) in pure exchange economies with three or more agents in which pure-consequentialistically...

We study Nash implementation by natural price-quantity mechanisms in pure exchange economies with free-disposal (Saijo et al., 1996, 1999) where agents have weak/strong intrinsic preferences for honesty (Dutta and Sen, 2012). Firstly, the Walrasian rule is shown tobe non-implementable where all...

The paper proposes necessary and suffi cient conditions for the natural implementation of (efficient) social choice correspondences (SCCs) in pure finite exchange economies when some of the agents are partially honest. A partially honest agent is an agent who strictly prefers to tell the truth...