{
  "id": "0807.4655",
  "version": "v1",
  "published": "2008-07-29T17:19:47.000Z",
  "updated": "2008-07-29T17:19:47.000Z",
  "title": "Candy-passing Games on General Graphs, II",
  "authors": [
    "Paul M. Kominers",
    "Scott D. Kominers"
  ],
  "comment": "3 pages",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-07-29T17:19:47.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C35",
      "05C85",
      "68Q25",
      "37B15",
      "68R10",
      "68Q80"
    ],
    "keywords": [
      "candy-passing game",
      "general graphs",
      "first proven",
      "polynomial bound",
      "prior literature"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 3,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0807.4655K"
    }
  }
}