Optimal rules for the sequential selection of uniform spacings

DOI10.1080/17442508.2020.1755286zbMath1490.60099OpenAlexW3018538204MaRDI QIDQ5086637

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit results for ordered 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
• Laws of the iterated logarithm for order statistics of uniform spacings
• A log log law for maximal uniform spacings
• Strong limiting bounds for maximal uniform spacings
• A new secretary problem with rank-based selection and cardinal payoffs
• Optimal selection based on relative rank (the 'Secretary Problem')
• Strong laws for the maximal k-spacing when k?c log n
• On the lengths of the pieces of a stick broken at random
• Uniform Partitions of an Interval
• Entropy and maximal spacings for random partitions
• Minimizing the expected rank with full information
• On the weak limit law of the maximal uniform k-spacing
• What is Known About Robbins' Problem?
• Dynamic Programming and Decision Theory
• On a Class of Problems Related to the Random Division of an Interval

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