How to allocate hard candies fairly

DOI10.1016/J.MATHSOCSCI.2007.04.008MaRDI QIDQ2463574zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Equitable Candy Sharing
• How to divide things fairly
• Fair Allocation of Indivisible Goods
• On allocating goods to maximize fairness
• Fair distributions for more participants than allocations
• Fair allocation of indivisible goods: improvement
• A note on a candy sharing game
• Fairness and implementability in allocation of indivisible objects with monetary compensations
• Allocating contiguous blocks of indivisible chores fairly
• Distributed fair allocation of indivisible goods

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3339981 (Why is no real title available?)
• 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
• Better ways to cut a cake
• Equitable distribution of indivisible objects
• Equitable, Envy-Free, and Efficient Cake Cutting for Two People and Its Application to Divisible Goods
• Fair division of indivisible items
• Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity
• Introduction to algorithms
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Vilfredo Pareto cuts the cake

Cited in

(4)

• Equitable Candy Sharing
• Towards a logical analysis of \textit{Adjusted Winner}
• Fair division of indivisible items between two players: design parameters for contested pile methods
• A general branch-and-bound algorithm for fair division problems

This page was built for publication: How to allocate hard candies fairly

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