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

DOI10.1016/J.EJOR.2018.05.057MaRDI QIDQ724147zbMATHOpenAlexWikidataFDO

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

Recommendations

• How to divide things fairly
• Fair allocation of indivisible goods: the two-agent case
• Two-person fair division of indivisible items when envy-freeness is impossible
• Fair division of indivisible items
• Proportional Borda allocations

Cites work

• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• A NEW MEASURE OF RANK CORRELATION
• Fair Allocation of Indivisible Goods
• Handbook of group decision and negotiation
• How to divide things fairly
• Proportional Borda allocations
• The Santa Claus problem
• The undercut procedure: an algorithm for the envy-free division of indivisible items
• \textit{In Silico} voting experiments

Cited in

(16)

• Towards a logical analysis of \textit{Adjusted Winner}
• Computing welfare-maximizing fair allocations of indivisible goods
• A correspondence between voting procedures and stochastic orderings
• Using the Borda rule for ranking sets of objects
• Almost envy-freeness in group resource allocation
• Comparing algorithms for fair allocation of indivisible items with limited information
• Computing a small agreeable set of indivisible items
• A general branch-and-bound algorithm for fair division problems
• Proportional Borda allocations
• How to divide things fairly
• Fair division of indivisible items between two players: design parameters for contested pile methods
• Fair choice sequences
• Two-person fair division of indivisible items when envy-freeness is impossible
• Fair allocation of indivisible goods with minimum inequality or minimum envy
• The price of connectivity in fair division
• Stability and welfare in (dichotomous) hedonic diversity games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724147)