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