Year: 2008
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Authors: Kominers, Paul M., Kominers, Scott D.
Institution: Massachusetts Institute of Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1530828143