Optimal rules for the sequential selection of uniform spacings

DOI10.1080/17442508.2020.1755286MaRDI QIDQ5086637zbMATH OpenOpenAlexFDO

Authors Yi-Shen Lin

Publication date 6 July 2022

Published in Stochastics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/17442508.2020.1755286

zbMATH Keywords

optimal stoppingsecretary problemuniform spacings

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Recommendations

• On multiple stopping bales
• Optimal selection based on relative ranks of a sequence by ties
• scientific article; zbMATH DE number 3901857
• The full-information best choice problem with a random number of observations
• Optimal sequential selection of a gambler assessed by the prophet

Cites work

• A log log law for maximal uniform spacings
• A new secretary problem with rank-based selection and cardinal payoffs
• Dynamic Programming and Decision Theory
• Entropy and maximal spacings for random partitions
• scientific article; zbMATH DE number 5016447 (Why is no real title available?)
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 627762 (Why is no real title available?)
• scientific article; zbMATH DE number 3223982 (Why is no real title available?)
• scientific article; zbMATH DE number 3233336 (Why is no real title available?)
• Laws of the iterated logarithm for order statistics of uniform spacings
• Limit results for ordered uniform spacings
• Minimizing the expected rank with full information
• On a Class of Problems Related to the Random Division of an Interval
• On the lengths of the pieces of a stick broken at random
• On the weak limit law of the maximal uniform \(k\)-spacing
• Optimal selection based on relative rank (the 'Secretary Problem')
• Strong laws for the maximal k-spacing when k?c log n
• Strong limiting bounds for maximal uniform spacings
• The asymptotic behavior of the reward sequence in the optimal stopping of i.i.d. random variables
• The full-information best choice problem with a random number of observations
• Uniform Partitions of an Interval
• What is Known About Robbins' Problem?

Cited in

(1)

• An optimal algorithm for stopping on the element closest to the center of an interval

This page was built for publication: Optimal rules for the sequential selection of uniform spacings

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