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

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

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