We present an exhaustive computational study of algorithms for two-person allocation of indivisible objects. We identify eight algorithms that generate balanced allocations using only players' ordinal rankings and test them over all possible rankings of up to N = 12 items. Algorithms are...

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...

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 fair-division procedure, called the Gap Procedure, that ensures (1) nonnegative prices that never...