A note on the selection of random variables under a sum constraint

DOI10.2307/3214697zbMath0749.60040OpenAlexW2326494591MaRDI QIDQ3988137

Michel Talagrand, WanSoo T. Rhee

Publication date: 28 June 1992

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214697

zbMATH Keywords

stopping timeprophet inequalitythreshold ruleon-line selection

Mathematics Subject Classification ID

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

Related Items

Sequential selection of random vectors under a sum constraint ⋮ Markov Decision Problems Where Means Bound Variances ⋮ Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays ⋮ Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards ⋮ Asymptotic expansions and strategies in the online increasing subsequence problem ⋮ Optimal online selection of a monotone subsequence: a central limit theorem ⋮ A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length ⋮ The BRS-inequality and its applications ⋮ Asymptotics and renewal approximation in the online selection of increasing subsequence ⋮ Quickest online selection of an increasing subsequence of specified size ⋮ Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence ⋮ Optimal rules for the sequential selection of monotone subsequences of maximum expected length