Two-player fair division of indivisible items: comparison of algorithms

DOI10.1016/j.ejor.2018.05.057zbMath1403.91213OpenAlexW2807266134MaRDI QIDQ724147

D. Marc Kilgour, Rudolf Vetschera

Publication date: 25 July 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.057

zbMATH Keywords

fair divisioncomputational studyBorda scoreindivisible items

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (9)

Two-person fair division of indivisible items when envy-freeness is impossible ⋮ A correspondence between voting procedures and stochastic orderings ⋮ Computing welfare-maximizing fair allocations of indivisible goods ⋮ Stability and welfare in (dichotomous) hedonic diversity games ⋮ Comparing algorithms for fair allocation of indivisible items with limited information ⋮ Almost envy-freeness in group resource allocation ⋮ Fair allocation of indivisible goods with minimum inequality or minimum envy ⋮ Using the Borda rule for ranking sets of objects ⋮ The Price of Connectivity in Fair Division

Cites Work

• Unnamed Item
• Proportional Borda allocations
• Handbook of group decision and negotiation
• The undercut procedure: an algorithm for the envy-free division of indivisible items
• In Silico Voting Experiments
• The Santa Claus problem
• How to Divide Things Fairly
• Fair Allocation of Indivisible Goods
• A NEW MEASURE OF RANK CORRELATION

This page was built for publication: Two-player fair division of indivisible items: comparison of algorithms