On fair cointossing games
Let [Omega] be a finite set with k elements and for each integer n [greater, double equals] 1 let [Omega]n = [Omega]  [Omega]  ...  [Omega] (ntuple) and 11 and aj [not equal to] aj+1 for some 1 [less, double equals] j [less, double equals] n  1}. Let {Ym} be a sequence of independent and identically distributed random variables such that P(Y1 = a) = k1 for all a in [Omega]. In this paper, we obtain some very surprising and interesting results about the first occurrence of elements in [Omega]n and in [Omega]n with respect to the stochastic process {Ym}. The results here provide us with a better and deeper understanding of the fair cointossing (ksided) process.
Year of publication: 
1979


Authors:  Chen, Robert ; Zame, Alan 
Published in: 
Journal of Multivariate Analysis.  Elsevier, ISSN 0047259X.  Vol. 9.1979, 1, p. 150156

Publisher: 
Elsevier 
Keywords:  fair cointossing process fair cointossing game the renewal theorem the Conway Algorithm stopping time the taboo first passage probability 
Saved in favorites
Similar items by person

Limiting distributions of two random sequences
Chen, Robert, (1984)

The Information Content of Insider Call Options Trading
Chen, Robert, (2005)

A remark on the tail probability of a distribution
Chen, Robert, (1978)
 More ...