In a game called red and black, you can stake any amount s in your possession. Suppose your goal is 1 and your current fortune is f, with 0 < f < 1. You win back your stake and as much more with probability p and lose your stake with probabili...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A105141734
Ahn, Chul H (Department of Applied Mathemetics, Sejong University) ; Sok, Yong-U (Department of Applied Mathemetics, Sejong University)
2002
Korean
KCI등재후보,SCOPUS,ESCI
학술저널
683-691(9쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
In a game called red and black, you can stake any amount s in your possession. Suppose your goal is 1 and your current fortune is f, with 0 < f < 1. You win back your stake and as much more with probability p and lose your stake with probabili...
In a game called red and black, you can stake any amount s in your possession. Suppose your goal is 1 and your current fortune is f, with 0 < f < 1. You win back your stake and as much more with probability p and lose your stake with probability, q = 1- p. Ahn(2000) considered optimum strategy for this game with the value of p less than $\frac{1}{2}$ where the house has the advantage over the player. The optimum strategy at any f when p < $\frac{1}{2}$ is to play boldly, which is to bet as much as you can. In this paper we perform the simulation study to show that the Bold strategy is optimum.
Block Designs For Comparisons Within Two Groups of Inbred Lines in Diallel Crosses
A Density-based Clustering Method
Confounding of Time Trend with Dropout Process in Longitudinal Data Analysis
Interactive Behaviour Simulation: Episode 18
Teachers TV Teachers TVInteractive Behaviour Simulation: Episode 21
Teachers TV Teachers TVInteractive Behaviour Simulation: Episode 20
Teachers TV Teachers TVInteractive Behaviour Simulation: Episode 2
Teachers TV Teachers TVInteractive Behaviour Simulation: Episode 19
Teachers TV Teachers TV