Showing 1 - 4 of 4
Persistent link: https://www.econbiz.de/10009625221
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...
Persistent link: https://www.econbiz.de/10013081091
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)....
Persistent link: https://www.econbiz.de/10013237412
Persistent link: https://www.econbiz.de/10013173208