%0 Journal Article
%T The Candy-Passing Game for c\geq3n-2
%A Paul M. Kominers
%J Mathematics
%D 2007
%I arXiv
%X We determine the behavior of Tanton's candy-passing game for all distributions of at least 3n-2 candies, where n is the number of students. Specifically, we show that the configuration of candy in such a game eventually becomes fixed.
%U http://arxiv.org/abs/0709.2156v3