Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 On nonoptimality of bold play for subfair red-and-black with a rational-valued house limit
作者 陳美如;蕭守仁;姚怡慶
Chen, May-Ru;Chumg, Pei-Shou; Hsiao, Shou-Jen;Yao, Yi-Ching
關鍵詞 Gambling theory;red-and-black;bold pla;optimal strategy
日期 2008-12
上傳時間 19-Oct-2010 22:52:03 (UTC+8)
摘要 In the subfair red-and-black gambling problem, a gambler can stake any amount in his possession, winning an amount equal to the stake with probability w and losing the stake with probability 1 - w, where 0 < w < ½. The gambler seeks to maximize the probability of reaching a fixed fortune (to be normalized to unity) by gambling repeatedly with suitably chosen stakes. In their classic work, Dubins and Savage (1965), (1976) showed that it is optimal to play boldly. When there is a house limit of l (0 < l < ½), so that the gambler can stake no more than l, Wilkins (1972) showed that bold play remains optimal provided that 1 / l is an integer. On the other hand, building on an earlier surprising result of Heath, Pruitt and Sudderth (1972), Schweinsberg (2005) recently showed that, for all irrational 0 < l < ½ and all 0 < w < ½, bold play is not optimal for some initial fortune. The purpose of the present paper is to present several results supporting the conjecture that, for all rational l with 1 / l not an integer and all 0 < w < ½, bold play is not optimal for some initial fortune. While most of these results are based on Schweinsberg`s method, in a special case where his method is shown to be inapplicable, we argue that the conjecture can be verified with the help of symbolic-computation software.
關聯 Journal of Applied Probability, 45(4), 1024-1038
資料類型 article
dc.creator (作者) 陳美如;蕭守仁;姚怡慶zh_TW
dc.creator (作者) Chen, May-Ru;Chumg, Pei-Shou; Hsiao, Shou-Jen;Yao, Yi-Ching-
dc.date (日期) 2008-12-
dc.date.accessioned 19-Oct-2010 22:52:03 (UTC+8)-
dc.date.available 19-Oct-2010 22:52:03 (UTC+8)-
dc.date.issued (上傳時間) 19-Oct-2010 22:52:03 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/47289-
dc.description.abstract (摘要) In the subfair red-and-black gambling problem, a gambler can stake any amount in his possession, winning an amount equal to the stake with probability w and losing the stake with probability 1 - w, where 0 < w < ½. The gambler seeks to maximize the probability of reaching a fixed fortune (to be normalized to unity) by gambling repeatedly with suitably chosen stakes. In their classic work, Dubins and Savage (1965), (1976) showed that it is optimal to play boldly. When there is a house limit of l (0 < l < ½), so that the gambler can stake no more than l, Wilkins (1972) showed that bold play remains optimal provided that 1 / l is an integer. On the other hand, building on an earlier surprising result of Heath, Pruitt and Sudderth (1972), Schweinsberg (2005) recently showed that, for all irrational 0 < l < ½ and all 0 < w < ½, bold play is not optimal for some initial fortune. The purpose of the present paper is to present several results supporting the conjecture that, for all rational l with 1 / l not an integer and all 0 < w < ½, bold play is not optimal for some initial fortune. While most of these results are based on Schweinsberg`s method, in a special case where his method is shown to be inapplicable, we argue that the conjecture can be verified with the help of symbolic-computation software.-
dc.language zh_TWen
dc.language.iso en_US-
dc.relation (關聯) Journal of Applied Probability, 45(4), 1024-1038en
dc.subject (關鍵詞) Gambling theory;red-and-black;bold pla;optimal strategy-
dc.title (題名) On nonoptimality of bold play for subfair red-and-black with a rational-valued house limiten
dc.type (資料類型) articleen