Equitable Candy Sharing

DOI10.4169/AMER.MATH.MONTHLY.124.6.518MaRDI QIDQ4575389zbMATH OpenOpenAlexWikidataFDO

Authors Grant Cairns

Publication date 13 July 2018

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.03723

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Multistage and repeated games (91A20)

Abstract: Children, sitting in a circle, each have a nonnegative number of candies in front of them. A whistle is blown and each child with more than one candy passes one candy to the left and one to the right. The sharing process is repeated until a fixed state is attained, or the system enters a periodic cycle. This paper treats the case where the total number of candies equals the number of children. For a given initial distribution of candies, a necessary and sufficient condition is given for the system to ultimately attain the equitable distribution in which each child has one candy.

Recommendations

• Candy Sharing
• How to allocate hard candies fairly
• A note on a candy sharing game
• Equitable allocation of divisible goods
• Cooperation in dividing the cake
• On the existence of equitable cake divisions
• On envy-free cake division
• On Envy-Free Cake Division

Cites work

• A constant bound for the periods of parallel chip-firing games with many chips
• Candy Sharing
• Mathematics galore! The first five years of the St. Mark's Institute of Mathematics

Cited in

(4)

• How to allocate hard candies fairly
• Candy Sharing
• A note on a candy sharing game
• Critical groups of graphs with dihedral actions. II.

This page was built for publication: Equitable Candy Sharing

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