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

This paper investigates fair (i.e., envy free and efficient) allocations in an overlapping generations economy without production and with two - period lived agents. We show that there exists a conflict between no-envy and efficiency when all generations have identical preferences. This conflict...

Strategy‐proofness (SP) is a sought‐after property in social choice functions because it ensures that agents have no incentive to misrepresent their private information at both the interim and ex post stages. Group strategy‐proofness (GSP), however, is a notion that is applied to the ex...

In college admissions and student placements at public schools, the admission decision can be thought of as assigning indivisible objects with capacity constraints to a set of students such that each student receives at most one object and monetary compensations are not allowed. In these...

We consider collective decisions made by agents whose preferences and power depend on past events and decisions. Faced with an ineffcient equilibrium and an opportunity to commit to a policy, can the agents reach an agreement on such a policy? Under an intuitive condition linking power...

We study the random assignment of indivisible objects among a set of agents with strict preferences. Random Serial Dictatorship is known to be only ex-post efficient and there exist mechanisms which Pareto-dominate it ex ante. However, we show that there is no mechanism that is likewise (i)...

We study the random assignment of indivisible objects among a set of agents with strict preferences. We show that there exists no mechanism which is unanimous, strategy-proof and envy-free. Weakening the first requirement to q-unanimity – i.e., when every agent ranks a different object at the...

We study the random assignment of indivisible objects among a set of agents with strict preferences. We show that there exists no mechanism which is unanimous, strategy-proof and envy-free. Weakening the first requirement to q-unanimity - i.e., when every agent ranks a different object at the...

We observe that three salient solutions to matching, division and house allocation problems are not only (partially) strategy-proof, but (partially) group strategy-proof as well, in appropriate domains of definition. That is the case for the Gale-Shapley mechanism, the uniform rule and the top...