English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93218/123590 (75%)
Visitors : 27739742      Online Users : 317
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 統計學系 > 期刊論文 >  Item 140.119/47289
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/47289

    Title: On nonoptimality of bold play for subfair red-and-black with a rational-valued house limit
    Authors: 陳美如;蕭守仁;姚怡慶
    Chen, May-Ru;Chumg, Pei-Shou;Hsiao, Shou-Jen;Yao, Yi-Ching
    Keywords: Gambling theory;red-and-black;bold pla;optimal strategy
    Date: 2008-12
    Issue Date: 2010-10-19 22:52:03 (UTC+8)
    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.
    Relation: Journal of Applied Probability, 45(4), 1024-1038
    Data Type: article
    Appears in Collections:[統計學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    10241038.pdf132KbAdobe PDF773View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

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