A high court has to decide whether a lawis constitutional, unconstitutional, or interpretable. The voting system is runoff. Runoff voting systems can be interpreted both, as social choice functions or as mechanisms. It is known that, for universal domains of preferences, runoff voting systems...

This article establishes versions of Moulin's (Public Choice 35:437-455, 1980) characterizations of various classes of strategy-proof social choice functions when the domain consists of all profiles of single-peaked preferences on an arbitrary subset of the real line. Two results are established...

We consider the problem of allocating infinitely divisible commodities among a group of agents. Especially, we focus on the case where there are several commodities to be allocated, and agents have continuous, strictly convex, and separable preferences. In this paper, we establish that the...

We consider situations where a society tries to efficiently allocate several homogeneous and indivisible goods among agents. Each agent receives at most one unit of the good. For example, suppose that a government wishes to allocate a fixed number of licenses to operate in its country to private...

We consider the problem of choosing a level of a public good on an interval of the real line among a group of agents. A probabilistic rule chooses a probability distribution over the interval for each preference profile. We investigate strategy-proof probabilistic rules in the case where...

We consider the problems of allocating several heterogeneous objects owned by governments to a group of agents and how much agents should pay. Each agent receives at most one object and has nonquasi-linear preferences. Nonquasi-linear preferences describe environments in which large-scale...

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

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

In this paper, we show that in pure exchange economies where the number of goods equals or exceeds the number of agents, any Pareto-efficient and strategy-proof allocation mechanism always allocates the total endowment to some single agent even if the receivers vary.