2008/07/29 by Paul Myer Kominers, Paul M. Kominers, Scott Duke Kominers +3
Computer Science · Mathematics · #05C35 #05C85 #37B15 #68Q25 (Primary) #68Q80 (Secondary) #68R10 #Cellular Automata and Applications #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #math.CO #msc:05C35 #msc:05C85 #msc:37B15 #msc:68Q25 #msc:68Q80 #msc:68R10 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0807.4655
3 pages
arxiv created 2008/07/29 · openalex publication_date 2008/07/29 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We give a new proof that any candy-passing game on a graph G with at least 4|E(G)|-|V(G)| candies stabilizes. (This result was first proven in arXiv:0807.4450.) Unlike the prior literature on candy-passing games, we use methods from the general theory of chip-firing games which allow us to obtain a polynomial bound on the number of rounds before stabilization.