A note on the gambling team method

Krzysztof Zajkowski

Statistics & Probability Letters, 2014, vol. 85, issue C, 45-50

Abstract: Gerber and Li (1981) formulated, using a Markov chain embedding, a system of equations that describes relations between generating functions of waiting time distributions for occurrences of patterns in a sequence of independent repeated experiments when the initial outcomes of the process are known. We show how this system of equations can be obtained by using the classical gambling team technique. We also present a form of solution of the system and give an example showing how first results of trials influence the probabilities that a chosen pattern precedes the remaining ones in a realization of the process.

Keywords: Martingales; Stopping times; Optional stopping theorem; Gambling team technique; Generating functions (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715213003647
Full text for ScienceDirect subscribers only

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:eee:stapro:v:85:y:2014:i:c:p:45-50

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spl.2013.11.003

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().