Fair division of indivisible items between two players: design parameters for contested pile methods

DOI10.1007/s11238-013-9385-0zbMath1304.91147OpenAlexW2051814790MaRDI QIDQ483924

Rudolf Vetschera, D. Marc Kilgour

Publication date: 17 December 2014

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11238-013-9385-0

zbMATH Keywords

fair divisioncomputational studycontested pile methods

Mathematics Subject Classification ID

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

Related Items (3)

A note on the undercut procedure ⋮ The undercut procedure: an algorithm for the envy-free division of indivisible items ⋮ Fair Division

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• To be fair or efficient or a bit of both
• A general branch-and-bound algorithm for fair division problems
• Max-min fairness in multi-commodity flows
• The undercut procedure: an algorithm for the envy-free division of indivisible items
• How to allocate hard candies fairly
• The Santa Claus problem
• Negotiation Analysis: A Characterization and Review
• A short proof of Sperner's lemma

This page was built for publication: Fair division of indivisible items between two players: design parameters for contested pile methods