Penney's Game Odds From No-Arbitrage

Joshua B. Miller

Papers from arXiv.org

Abstract: Penney's game is a two-player zero-sum game in which each player chooses a three-flip pattern of heads and tails, and the winner is the player whose pattern occurs first in repeated tosses of a fair coin. Because the players choose sequentially, the second mover has the advantage. In fact, for any three-flip pattern, there is another three-flip pattern that is strictly more likely to occur first. This paper provides a novel no-arbitrage argument that generates the winning odds corresponding to any pair of distinct patterns. The resulting formula is equivalent to that generated by Conway's ``leading number'' algorithm. The accompanying betting-odds intuition adds insight into why Conway's algorithm works. The proof is simple and easy to generalize to games involving more than two outcomes, unequal probabilities, and competing patterns of various lengths. Additional results on the expected duration of Penney's game are presented.

Date: 2019-03, Revised 2026-05
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Miller, J.B. Penney's game odds from no-arbitrage. Theory and Decision (2026)

Downloads: (external link)
http://arxiv.org/pdf/1904.09888 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1904.09888

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().