A random version of shepp's urn scheme

doi:10.1137/S0895480102418099

淡江大學機構典藏 > 理學院 > 數學學系暨研究所 > 期刊論文 > Item 987654321/41295

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/41295

題名:	A random version of shepp's urn scheme
作者:	Chen, Robert W.;Zame, Alan;林千代;Lin, Chien-tai;吳秀芬;Wu, Hsiu-fen
貢獻者:	淡江大學數學學系
關鍵詞:	urn scheme;optimal drawing policy;random coin tossing process;stopping time;the “k” in the hole policy
日期:	2005-06
上傳時間:	2010-01-28 07:12:59 (UTC+8)
出版者:	Philadelphia: Society for Industrial and Applied Mathematics (SIAM)
摘要:	In this paper, we consider the following random version of Shepp’s urn scheme: A player is given an urn with n balls. p of these balls have value +1 and n − p have value −1. The player is allowed to draw balls randomly, without replacement, until he or she wants to stop. The player knows n, the total number of balls, but knows only that p, the number of balls of value +1, is a number selected randomly from the set {0,1,2,...,n}. The player wishes to maximize the expected value of the sum of the balls drawn. We ﬁrst derive the player’s optimal drawing policy and an algorithm to compute the player’s expected value at the stopping time when he or she uses the optimal drawing policy. Since the optimal drawing policy is rather intricate and the computation of the player’s optimal expected value is quite cumbersome, we present a very simple drawing policy, which is asymptotically optimal. We also show that this random urn scheme is equivalent to a random coin tossing problem.
關聯:	Siam Journal on Discrete Mathematics 19(1), pp.149-164
DOI:	10.1137/S0895480102418099
顯示於類別:	[數學學系暨研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
0895-4801_19(1)p149-164.pdf		196Kb	Adobe PDF	793	檢視/開啟
index.html		0Kb	HTML	72	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....