A jury has to choose the winner of a contest. There exists a deserving winner, whose identity is common knowledge among the jurors, but not known by the planner. Jurors may be biased in favor (friend) or against (enemy) some contestants. We study conditions on the confi?guration of the jury so...

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

I show how improper conditioning of beliefs can lead to under-contribution in public goods environments with interdependent values. I consider a simple model of a binary, excludable public good. In equilibrium, provision of the public good is good news about its value. Naive players who...

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

In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...

This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.

A team must select among competing projects that differ in their payoff consequences for its members. Each agent chooses a project and exerts costly effort affecting its random completion time. When one or more projects are complete, agents bargain over which one to implement. A consensus...

We consider a network economy in which economic agents are connected within a structure of value-generating relationships. Agents are assumed to be able to participate in three types of economic activities: autarkic self-provision; binary matching interactions; and multi-person cooperative...

We consider a relational economy in which economic agents participate in three types of relational economic activities: autarkic activities; binary matching activities; and plural cooperative activities. We introduce a stability notion and characterize stable interaction structures, both in the...