Brams, Steven; Kilgour, Marc; Klamler, Christian - Volkswirtschaftliche Fakultät, … - 2015
Assume that two players have strict rankings over an even number of indivisible items. We propose algorithms to find 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. We...