A gambling system and a Markov chain (Q1354842): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Stewart N. Ethier / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Klaus Dohmen / rank | |||
Normal rank |
Revision as of 08:26, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A gambling system and a Markov chain |
scientific article |
Statements
A gambling system and a Markov chain (English)
0 references
29 October 1997
0 references
The authors investigate a gambling system known as Oscar's system in which the aim is to win one betting unit, at least with high probability, and then start over again. The system is modeled by an irreducible Markov chain in a subset of the two-dimensional integer lattice. It is shown that the Markov chain, which depends on a parameter \(p\) representing the single-trial win probability, is transient if \(p<0.5\) and positive recurrent if \(p\geq 0.5\).
0 references
gambling system
0 references
Markov chain
0 references
Oscar's system
0 references
transient
0 references
positive recurrent
0 references