A Random Version of Shepp's Urn Scheme

DOI10.1137/S0895480102418099zbMATH Open1086.60509OpenAlexW2009339030MaRDI QIDQ5317606FDOQ5317606

Authors: Alan Zame, Chien-Tai Lin, Hsiu-Fen Wu, Robert W. Chen 

Publication date: 16 September 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480102418099

Recommendations

• A note on randomized Shepp's urn scheme
• A random version of Sperner's theorem
• scientific article; zbMATH DE number 3000050
• A generalized urn with multiple drawing and random addition
• An efficient generation method for uniformly distributed random numbers
• A protocol for generating random elements with their probabilities
• A randomized version of Ramsey's theorem
• A randomized version of Ramsey's theorem
• scientific article; zbMATH DE number 781100
• Random generation using binomial approximations

zbMATH Keywords

stopping timeoptimal drawing policythe \(k\) in the hole policyrandom coin tossing process

Mathematics Subject Classification ID

Special processes (60K99) Stopping times; optimal stopping problems; gambling theory (60G40)

Cited In (9)

• Title not available (Why is that?)
• On-line VWAP Trading Strategies
• With or without replacement? Sampling uncertainty in Shepp’s urn scheme
• Value of information in the Polya urn process
• A generalization of the Mabinogion sheep problem of D. Williams
• Optimal stopping for Shepp's urn with risk aversion
• Some Results for the Acceptance Urn Model
• A note on randomized Shepp's urn scheme
• Easily determining which urns are 'favorable'

This page was built for publication: A Random Version of Shepp's Urn Scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317606)