English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 30014188      線上人數 : 353
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/16711

題名: On Nonoptimality of Bold Play for Subfair Red-and-Black with a Rational-Valued House Limit
作者: Chen, May-Ru;Chung, Pei-Shou;Hsiau, Shoou-Ren;Yao, Yi-Ching
貢獻者: 數學系
關鍵詞: Gambling theory;Red-and-black;Bold play;Optimal strategy
日期: 2008-12
上傳時間: 2013-06-05T07:41:12Z
出版者: Applied Probability Trust
摘要: 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 on 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
顯示於類別:[數學系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
index.html0KbHTML608檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋