How to allocate hard candies fairly

DOI10.1016/j.mathsocsci.2007.04.008zbMath1141.91562OpenAlexW2044778404MaRDI QIDQ2463574

Raffaele Mosca, Marco Dall'Aglio

Publication date: 14 December 2007

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2007.04.008

zbMATH Keywords

fair divisionindivisible itemsadjusted winner

Mathematics Subject Classification ID

2-person games (91A05) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

Fair division of indivisible items between two players: design parameters for contested pile methods ⋮ A general branch-and-bound algorithm for fair division problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable distribution of indivisible objects
• Vilfredo Pareto cuts the cake
• Fair division of indivisible items
• Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
• A simple procedure for finding equitable allocations of indivisible goods
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods