Many procedures have been suggested for the venerable problem of dividing a set of indivisible items between two players. We propose a new algorithm (AL), related to one proposed by Brams and Taylor (BT), which requires only that the players strictly rank items from best to worst. Unlike BT, in...

A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are...

We study the problem of dissolving a partnership when agents have unequal endowments. Agents bid on the price of the entire partnership. The highest bidder is awarded the partnership and buys out her partners' shares at a per-unit price that is a function of the two highest bids. We show that...