On fair coin-tossing games

Robert Chen, Alan Zame

Research output: Contribution to journalArticle

7 Scopus citations

Abstract

Let Ω be a finite set with k elements and for each integer n ≧ 1 let Ωn = Ω × Ω × ... × Ω (n-tuple) and Ωn = {(a1, a2,..., an)

Original languageEnglish (US)
Pages (from-to)150-156
Number of pages7
JournalJournal of Multivariate Analysis
Volume9
Issue number1
DOIs
StatePublished - Mar 1979

Keywords

  • fair coin-tossing game
  • fair coin-tossing process
  • stopping time
  • the Conway Algorithm
  • the renewal theorem
  • the taboo first passage probability

ASJC Scopus subject areas

  • Statistics and Probability
  • Numerical Analysis
  • Statistics, Probability and Uncertainty

Fingerprint Dive into the research topics of 'On fair coin-tossing games'. Together they form a unique fingerprint.

  • Cite this