In this paper, we revisit a long-standing question on the structure of strategy-proof and Pareto-efficient social choice functions (SCFs) in classical exchange economies (Hurwicz (1972)). Using techniques developed by Myerson in the context of auction-design, we show that in a specific...

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

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

This paper takes a mechanism design approach to federalism and assumes that local preferences are the private information of local jurisdictions. Contractual federalism is defined as a strategy-proof contract among the members of the federation supervised by a benevolent but not omniscient...

In a linear production model, we characterize the class of efficient and strategy-proof allocation functions, and the class of efficient and coalition strategy-proof allocation functions. In the former class, requiring equal treatment of equals allows us to identify a unique allocation function....

It is known that majority voting among several individuals on logically interconnected propositions may generate irrational collective judgments. We generalize majority voting by considering quota rules, which accept each proposition if and only if the number of individuals accepting it exceeds...

For exchange economies with classical economic preferences, it is shown that any strategy-proof social choice function that selects Pareto optimal outcomes cannot guarantee everyone a consumption bundle bounded away from the origin. This result demonstrates that there is a fundamental conflict...

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

Random mechanisms have been used in real-life situations for reasons such as fairness. Voting and matching are two examples of such situations. We investigate whether desirable properties of a random mechanism survive decomposition of the mechanism as a lottery over deterministic mechanisms that...

We generalize the traditional concept of single-peaked preference domains in two ways. First, we introduce the concept of a multiple single-peaked domain, where the set of alternatives is equipped with several underlying orderings with respect to which a preference can be single-peaked, and we...