Pages that link to "Item:Q1854796"
From MaRDI portal
The following pages link to Optimal rules for the sequential selection of monotone subsequences of maximum expected length (Q1854796):
Displaying 20 items.
- Stochastic processes with proportional increments and the last-arrival problem (Q444355) (← links)
- Optimal online selection of a monotone subsequence: a central limit theorem (Q491928) (← links)
- A central limit theorem for the optimal selection process for monotone subsequences of maximum expected length (Q556644) (← links)
- On approximative solutions of multistopping problems (Q655588) (← links)
- Sequential selection of an increasing sequence from a multidimensional random sample. (Q1578609) (← links)
- Asymptotics and renewal approximation in the online selection of increasing subsequence (Q2040096) (← links)
- Diffusion approximations in the online increasing subsequence problem (Q2048141) (← links)
- Sequential selection of an increasing subsequence from a random sample with geometrically distributed sample-size (Q2759600) (← links)
- Quickest online selection of an increasing subsequence of specified size (Q2820269) (← links)
- Sequential selection of a monotone subsequence from a random permutation (Q2821757) (← links)
- Markov Decision Problems Where Means Bound Variances (Q2931706) (← links)
- Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence (Q3103629) (← links)
- Online Selection of Alternating Subsequences from a Random Sample (Q3108479) (← links)
- Recognising the last record of sequence (Q3429340) (← links)
- An adaptive <i>O</i>(log <i>n</i>)‐optimal policy for the online selection of a monotone subsequence from a random sample (Q4601440) (← links)
- A new strategy for Robbins’ problem of optimal stopping (Q4684856) (← links)
- Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem (Q5169506) (← links)
- What is Known About Robbins' Problem? (Q5312844) (← links)
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays (Q5364222) (← links)
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object (Q5488991) (← links)