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

We consider the problem of allocating multiple units of an indivisible object among a set of agents and collecting payments. Each agent can receive multiple units of the object, and has a (possibly) non-quasi-linear preference on the set of (consumption) bundles. We assume that preferences...

Consider a setting in which individual strict preferences need to be aggregated into a social strict preference relation. For two alternatives and an odd number of agents, it follows from May’s Theorem that the majority aggregation rule is the only one satisfying anonymity, neutrality, and...

We consider the problem of allocating several types of indivisible goods when preferences are separable and monetary transfers are not allowed. Our finding is that the coordinatewise application of strategy-proof and non-wasteful rules yields a strategy-proof rule with the following efficiency...

This paper generalizes the results in Aswal et al. (2003) on dictatorial domains. This is done in two ways. In the first, the notion of connections between pairs of alternatives in Aswal et al. (2003) is weakened to weak connectedness. This notion requires the specification of four preference...

In this paper we consider the exogenous indifference classes model of Barberá and Ehlers (2011) and Sato (2009) and analyze further the relationship between the structure of indifference classes across agents and dictatorship results. The key to our approach is the pairwise partition graph. We...

We consider the problem of probabilistically allocating a single indivisible good among agents when monetary transfers are allowed. We construct a new strategy-proof rule, called the second price trading rule, and show that it is second best efficient. Furthermore, we give the second price...

This paper considers the problem of allocating N indivisible objects among N agents according to their preferences when transfers are not allowed, and studies the tradeoff between fairness and efficiency in the class of strategy-proof mechanisms. The main finding is that for strategy-proof...

We consider the allocation problem of assigning heterogenous objects to a group of agents and determining how much they should pay. Each agent receives at most one object. Agents have non-quasi-linear preferences over bundles, each consisting of an object and a payment. Especially, we focus on...

We analyze bankruptcy problems with an indivisible object, where real owners and outside traders want to allocate an indivisible object among them with monetary compensation. The object might be a company that has gone bankrupt or a house left by a parent who has died, and so on. We show that...