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

@article{Brams2012TheUP,
  title={The undercut procedure: an algorithm for the envy-free division of indivisible items},
  author={S. Brams and D. Kilgour and Christian Klamler},
  journal={Social Choice and Welfare},
  year={2012},
  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… Expand
View on Springer
mpra.ub.uni-muenchen.de
56 Citations
Highly Influential Citations
2
Background Citations
26
Methods Citations
4

56 Citations

Citation Type

Citation Type

Two-person fair division of indivisible items: An efficient, envy-free algorithm
TLDR
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. Expand
Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm
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… Expand
Two-Person Fair Division of Indivisible Items when Envy-Freeness is Impossible
TLDR
Algorithms are provided to find an almost-EF allocation that is as close as possible to EF – as well as complete, balanced, and PO. Expand
An Algorithm for the Proportional Division of Indivisible Items
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… Expand
Maximin Envy-Fee Division of Indivisible Items
Abstract 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… Expand
Strategic Behavior in Contested-Pile Methods for Fair Division of Indivisible Items
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;… Expand
Asymptotic Existence of Fair Divisions for Groups
The problem of dividing resources fairly occurs in many practical situations and is therefore an important topic of study in economics. In this paper, we investigate envy-free divisions in the… Expand
Asymptotic existence of fair divisions for groups
TLDR
This paper investigates envy-free divisions in the setting where there are multiple players in each interested party and shows that a simple truthful mechanism, namely the random assignment mechanism, yields an allocation that satisfies the weaker notion of approximate envy-freeness with high probability. Expand
Almost Envy-Freeness in Group Resource Allocation
TLDR
A new model where the agents are not partitioned into groups in advance, but instead the partition can be chosen in conjunction with the allocation of the goods and it is shown that for agents with arbitrary monotonic valuations, there is always a partition of the agents into two groups of any given sizes. Expand
Almost envy-freeness in group resource allocation
TLDR
A new model where the agents are not partitioned into groups in advance, but instead the partition can be chosen in conjunction with the allocation of the goods and it is shown that for agents with arbitrary monotonic valuations, there is always a partition of the agents into two groups of any given sizes. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Strategic Behavior in Contested-Pile Methods for Fair Division of Indivisible Items
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;… Expand
Paradoxes of Fair Division
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.… Expand
Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
TLDR
Algorithms that render fair division practicable are proposed, and their vulnerability to strategic manipulation is investigated. Expand
Efficient Fair Division
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… Expand
A simple procedure for finding equitable allocations of indivisible goods
TLDR
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. Expand
Fair division of indivisible items among people with similar preferences
TLDR
It is observed that a situation can have envy-free divisions none of which is Pareto-optimal, and envy-freeness within a division and Pare to optimality among divisions are observed. Expand
FAIR DIVISION OF INDIVISIBLE ITEMS
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… Expand
Competitive Fair Division
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… Expand
Dividing the Indivisible
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… Expand
Prisoners' Dilemma and Professional Sports Drafts
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… Expand
...
1
2
3
...