Maximin Envy-Free Division of Indivisible Items
- First Online:
- Cite this article as:
- Brams, S.J., Kilgour, D.M. & Klamler, C. Group Decis Negot (2017) 26: 115. doi:10.1007/s10726-016-9502-x
- 68 Downloads
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 of the items that the players receive—and are envy-free and Pareto-optimal, if such allocations exist. To determine whether an envy-free allocation exists, we introduce a simple condition on preference profiles; in fact, our condition guarantees the existence of a maximin, envy-free, and Pareto-optimal allocation. Although not strategy-proof, our algorithms would be difficult to manipulate unless a player has complete information about its opponent’s ranking. We assess the applicability of the algorithms to real-world problems, such as allocating marital property in a divorce or assigning people to committees or projects.