Candy-passing Games on General Graphs, II
Combinatorics
2008-07-30 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.0807.4655,
title = {Candy-passing Games on General Graphs, II},
author = {Paul M. Kominers and Scott D. Kominers},
journal= {arXiv preprint arXiv:0807.4655},
year = {2008}
}
Comments
3 pages