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

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

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

We study strategy-proof probabilistic mechanisms in a binary public decision model when monetary transfers are allowed. We consider not only the pivotal mechanism, the majority voting mechanism, the random serial dictatorship mechanism, and the unanimity mechanism, but also the random chair...

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

Die vorliegende Arbeit untersucht die Aufteilung eines Budgets auf mehrere öffentliche Güter mittels einer Abstimmung. Hierzu betrachten wir Abstimmungsregeln, unter denen jeder Agent eine Budgetaufteilung vorschlägt und dann aus diesen Vorschlägen eine Budgetaufteilung (Allokation) bestimmt...

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

We conduct laboratory experiments for the Vickrey auction with and without an announcement on strategy-proofness to subjects. Although the rate of truth-telling among the subjects stays at 20% without the announcement, it increases to 47% with the announcement. Moreover, by conducting...

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.