On optimal strategies for a betting game (Q809914)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4211841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On optimal strategies for a betting game |
scientific article; zbMATH DE number 4211841 |
Statements
On optimal strategies for a betting game (English)
0 references
1990
0 references
A one-person game in which the player can bet up to n times is considered. The amount of each bet is between 0 and 1 and the probability to win any bet is \(p\in (0,1)\). The player wins the game if the final result is a given positive integer m. If \(p\leq 1/2\), then the strategy N(n,m) of betting 1 every time until m is reached is optimal. If \(p>1/2\), this strategy is not optimal if n is sufficiently large.
0 references
one-person game
0 references
0.7913737297058105
0 references
0.7572826147079468
0 references
0.7542088627815247
0 references
