# The undercut procedure: an algorithm for the envy-free division of indivisible items

@article{Brams2009TheUP, title={The undercut procedure: an algorithm for the envy-free division of indivisible items}, author={Steven J. Brams and D. Marc Kilgour and Christian Klamler}, journal={Social Choice and Welfare}, year={2009}, volume={39}, pages={615-631} }

We propose a procedure for dividing a set of indivisible items between two players. We assume that each player’s preference over subsets of items is consistent with a strict ranking of the items, and that neither player has information about the other’s preferences. Our procedure ensures an envy-free division—each player receives a subset of items that it values more than the other player’s complementary subset—given that an envy-free division of “contested items,” which the players would…

## 57 Citations

### Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm

- Economics
- 2013

A new algorithm, related to one proposed by Brams and Taylor (BT), which requires only that the players strictly rank items from best to worst, and the allocation(s) it yields are Pareto-optimal, envy-free, and maximal.

### Two-Person Fair Division of Indivisible Items when Envy-Freeness is Impossible

- EconomicsOper. Res. Forum
- 2022

Algorithms are provided to find an almost-EF allocation that is as close as possible to EF – as well as complete, balanced, and PO.

### Maximin Envy-Free Division of Indivisible Items

- EconomicsGroup Decision and Negotiation
- 2016

Assume that two players have strict rankings over an even number of indivisible items. We propose two algorithms to find balanced allocations of these items that are maximin—maximize the minimum rank…

### An Algorithm for the Proportional Division of Indivisible Items

- Economics
- 2014

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…

### Strategic Behavior in Contested-Pile Methods for Fair Division of Indivisible Items

- EconomicsGroup Decision and Negotiation
- 2011

Most fair-division procedures are modeled on cake-cutting procedures such as “I cut, you choose”. The inputs are players’ choices, which are assumed to reflect preferences but not fully reveal them;…

### Strategic Behavior in Contested-Pile Methods for Fair Division of Indivisible Items

- Economics
- 2013

Most fair-division procedures are modeled on cake-cutting procedures such as “I cut, you choose”. The inputs are players’ choices, which are assumed to reflect preferences but not fully reveal them;…

### A General Elicitation-Free Protocol for Allocating Indivisible Goods

- EconomicsIJCAI
- 2011

This work considers the process of allocating objects one after the other by designating an agent and asking her to pick one of the objects among those that remain, and addresses the computation of a sequence maximizing expected social welfare under several assumptions.

## References

SHOWING 1-10 OF 21 REFERENCES

### Strategic Behavior in Contested-Pile Methods for Fair Division of Indivisible Items

- Economics
- 2013

Most fair-division procedures are modeled on cake-cutting procedures such as “I cut, you choose”. The inputs are players’ choices, which are assumed to reflect preferences but not fully reveal them;…

### Paradoxes of Fair Division

- Economics
- 2001

Two or more players are required to divide up a set of indivisible items that they can rank from best to worst. They may, as well, be able to indicate preferences over subsets, or packages, of items.…

### Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity

- EconomicsSoc. Choice Welf.
- 2000

Algorithms that render fair division practicable are proposed, and their vulnerability to strategic manipulation is investigated.

### Efficient Fair Division

- Economics
- 2005

Two or more players rank a set of indivisible items from best to worst. An efficient allocation of items is characterized, which may satisfy such properties as maximin, Borda maximin, and…

### A simple procedure for finding equitable allocations of indivisible goods

- Economics, SociologySoc. Choice Welf.
- 2002

It is shown that thedescending demand procedure generally fares well on an interpersonal criterion of “balancedness”; specifically, the resulting allocations are Pareto-optimal and maximize the well-being of the worst-off individual.

### Fair division of indivisible items among people with similar preferences

- EconomicsMath. Soc. Sci.
- 2001

### FAIR DIVISION OF INDIVISIBLE ITEMS

- Economics
- 2003

This paper analyzes criteria of fair division of a set of indivisible items among people whose revealed preferences are limited to rankings of the items and for whom no side payments are allowed. The…

### Competitive Fair Division

- EconomicsJournal of Political Economy
- 2001

Several indivisible goods are to be divided among two or more players, whose bids for the goods determine their prices. An equitable assignment of the goods at competitive prices is given by a…

### Dividing the Indivisible

- Economics, Political Science
- 2002

Political parties in Northern Ireland recently used a divisor method of apportionment to choose, in sequence, ten cabinet ministries. If the parties have complete information about each other’s…

### Prisoners' Dilemma and Professional Sports Drafts

- Economics
- 1979

In social situations in which each individual rationally pursues his self-interest, it is well known that the result may be unsatisfactory for everyone involved. Despite the familiarity of this…