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

Condorcet domains are sets of linear orders with the property that, whenever the preferences of all voters of a society belong to this set, their majority relation has no cycles. We observe that, without loss of generality, every such domain can be assumed to be closed in the sense that it...

Consider the problem of allocating objects to agents and how much they should pay. Each agent has a preference relation over pairs of a set of objects and a payment. Preferences are not necessarily quasi-linear. Non-quasi-linear preferences describe environments where payments influence agents'...

We consider the problem of fairly reallocating the individual endowments of a perfectly divisible good among agents with single-peaked preferences. We provide a new concept of fairness, called position-wise envy-freeness, that is compatible with individual rationality. This new concept requires...

The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function...

We consider the problem of allocating objects to a group of agents and how much agents should pay. Each agent receives at most one object and has non-quasi-linear preferences. Non-quasi-linear preferences describe environments where payments influence agents' abilities to utilize objects or...