Assume two players, A and B, must divide a set of indivisible items that each strictly ranks from best to worst. If the number of items is even, assume that the players desire that the allocations be balanced (each player gets half the items), item-wise envy-free (EF), and Pareto-optimal (PO)....

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

We propose a procedure for dividing indivisible items between two players in which each player ranks the items from best to worst. It ensures that each player receives a subset of items that it values more than the other player's complementary subset, given that such an envy-free division is...