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

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 study the slot allocation problem where agents have quasi-linear single-peaked preferences over slots and identify the rules satisfying efficiency, strategy-proofness, and individual rationality. Since the quasi-linear single-peaked domain is not connected, the famous characterization of the...

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.

We consider the problem of allocating heterogeneous objects to agents with money, where the number of agents exceeds that of objects. Each agent can receive at most one object, and some objects may remain unallocated. A bundle is a pair consisting of an object and a payment. An agent's...

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

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

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