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

The classic fair cake-cutting problem [Steinhaus, 1948] is extended by introducing geometric constraints on the allocated pieces. Specifically, agents may demand to get their share as a square or a rectangle with a bounded length/width ratio. This is a plausible constraint in realistic...

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

We experimentally investigate four allocation mechanisms - all based on the fair division approach, with varying bid elicitation methods and price rules - in terms of their allocation efficiency, distributional effects, and regularities in individual bidding behavior. In a repeated design, an...

Although one may hope to achieve equality of stated profits without enforcing it, one may not trust in such voluntary equality seeking and rather try to impose rules (of bidding) guaranteeing it. Our axiomatic approach is based on envy-free net trades according to bids which, together with the...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision.

An unceasing problem of our prevailing society is the fair division of goods. The problem of proportional cake cutting focuses on dividing a heterogeneous and divisible resource, the cake, among n players who value pieces according to their own measure function. The goal is to assign each player...

In an incomplete information setting, we analyze the sealed bid auction proposed by Knaster (cf. Steinhaus (1948)). This procedure was designed to efficiently and fairly allocate multiple indivisible items when participants report their valuations truthfully. In equilibrium, players do not...