We consider the problem of fairly dividing <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$l$$</EquationSource> </InlineEquation> divisible goods among <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$n$$</EquationSource> </InlineEquation> agents with the generalized Leontief preferences. We propose and characterize the class of generalized egalitarian rules which satisfy efficiency, group strategy-proofness, anonymity, resource monotonicity,...</equationsource></inlineequation></equationsource></inlineequation>

We analyze a simple sequential algorithm (SA) for allocating indivisible items that are strictly ranked by n ≥ 2 players. It yields at least one Pareto-optimal allocation which, when n = 2, is envy-free unless no envy-free allocation exists. However, an SA allocation may not be maximin or...

An allocation of indivisible items among n ≥ 2 players is proportional if and only if each player receives a proportional subset—one that it thinks is worth at least 1/n of the total value of all the items. We show that a proportional allocation exists if and only if there is an allocation...

Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of them also take into account self-interested agents and consequent strategic issues, but these papers focus on...

Contested Pile methods are two-phase procedures for the fair allocation of indivisible items to two players. In the Generation Phase, items over which the players’ preferences differ widely enough are allocated. “Contested” items are placed in the Contested Pile, which is then allocated in...

Questions of burden sharing receive increasing attention in the climate change regime. This paper introduces the WESA-mechanism (WESA = Walrasian Equilibrium with the Stand Alone upper bound) for the fair division of common property resources and monetary compensations. Furthermore, the...

This paper introduces a solution for the fair division of common property resources in production economies with multiple inputs and outputs. It is derived from complementing the Walrasian solution by welfare bounds, whose ethical justification rests on commonality of ownership. We then apply...

We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive...