3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2008★ 3 cited
Candy-passing Games on General Graphs, II
Paul M. Kominers, Scott D. Kominers
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 li…
math.CO2008
Candy-passing Games on General Graphs, I
Paul M. Kominers, Scott D. Kominers
We undertake the first study of the candy-passing game on arbitrary connected graphs. We obtain a general stabilization result which encompasses the first author's results (arXiv:0…
math.CO2007
The Candy-Passing Game for c\geq3n-2
Paul M. Kominers
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 configura…