8 citations · 14 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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…