Optimal rules for the sequential selection of monotone subsequences of maximum expected length
From MaRDI portal
Publication:1854796
DOI10.1016/S0304-4149(01)00122-3zbMath1005.60056MaRDI QIDQ1854796
F. Thomas Bruss, Freddy Delbaen
Publication date: 27 January 2003
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
integral equationrecord valuesPoisson processmartingale approachbin-packing problemconcentration measuregraph-rules
Related Items
What is Known About Robbins' Problem? ⋮ Markov Decision Problems Where Means Bound Variances ⋮ Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays ⋮ Stochastic processes with proportional increments and the last-arrival problem ⋮ On approximative solutions of multistopping problems ⋮ Optimal online selection of a monotone subsequence: a central limit theorem ⋮ Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem ⋮ A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length ⋮ A new strategy for Robbins’ problem of optimal stopping ⋮ Asymptotics and renewal approximation in the online selection of increasing subsequence ⋮ Diffusion approximations in the online increasing subsequence problem ⋮ Quickest online selection of an increasing subsequence of specified size ⋮ Sequential selection of a monotone subsequence from a random permutation ⋮ Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence ⋮ An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object ⋮ Online Selection of Alternating Subsequences from a Random Sample ⋮ Recognising the last record of sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal sequential selection of a monotone sequence from a random sample
- Point processes and queues. Martingale dynamics
- A variational problem for random Young tableaux
- Sequential selection of an increasing sequence from a multidimensional random sample.
- Algebraic aspects of increasing subsequences
- Limiting curves for i.i.d. records
- Ordered independent scattering Ordered independent
- ‘Wald's Lemma' for sums of order statistics of i.i.d. random variables
- A note on the selection of random variables under a sum constraint
- Smallest-fit selection of random sizes under a sum constraint: weak convergence and moment comparisons
- On the distribution of the length of the longest increasing subsequence of random permutations
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Optimal selection of stochastic intervals under a sum constraint
- A Note on Sequential Selection from Permutations
- Sequential selection of an increasing subsequence from a sample of random size
