{
  "id": "2502.07402",
  "version": "v1",
  "published": "2025-02-11T09:31:02.000Z",
  "updated": "2025-02-11T09:31:02.000Z",
  "title": "Generalizations of the M&M Game",
  "authors": [
    "Snehesh Das",
    "Evan Li",
    "Steven J. Miller",
    "Andrew Mou",
    "Geremias Polanco",
    "Wang Xiaochen",
    "April Yang",
    "Chris Yao"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "The M&M Game was created to help young kids explore probability by modeling a response to the question: \\emph{If two people are born on the same day, will they die on the same day?} Each player starts with a fixed number of M&M's and a fair coin; a turn consists of players simultaneously tossing their coin and eating an M&M only if the toss is a head, with a person ``dying'' when they have eaten their stash. The probability of a tie can naturally be written as an infinite sum of binomial products, and can be reformulated into a finite calculation using memoryless processes, recursion theory, or graph-theoretic techniques, highlighting its value as an educational game. We analyze several extensions, such as tossing multiple coins with varying probabilities and evolving probability distributions for coin flips. We derive formulas for the expected length of the game and the probability of a tie by modeling the number of rounds as a sum of geometric waiting times.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2025-02-11T09:31:02.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60G51"
    ],
    "keywords": [
      "generalizations",
      "help young kids",
      "geometric waiting times",
      "evolving probability distributions",
      "tossing multiple coins"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}