Pages that link to "Item:Q491928"
From MaRDI portal
The following pages link to Optimal online selection of a monotone subsequence: a central limit theorem (Q491928):
Displaying 9 items.
- The BRS-inequality and its applications (Q2039762) (← links)
- Asymptotics and renewal approximation in the online selection of increasing subsequence (Q2040096) (← links)
- Diffusion approximations in the online increasing subsequence problem (Q2048141) (← links)
- A unified approach for solving sequential selection problems (Q2188431) (← links)
- Asymptotic expansions and strategies in the online increasing subsequence problem (Q2230576) (← links)
- On-line scheduling with monotone subsequence constraints (Q2319898) (← 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)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)