Pages that link to "Item:Q3988137"
From MaRDI portal
The following pages link to A note on the selection of random variables under a sum constraint (Q3988137):
Displaying 18 items.
- 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)
- Largest-first sequential selection with a sum constraint (Q753676) (← links)
- Generalizations of maximal inequalities to arbitrary selection rules (Q1640918) (← links)
- Maximizing \(E\max _{1\leq k\leq n}S^+_ k/ES^+_ n:\) A prophet inequality for sums of i.i.d. mean zero variates (Q1825517) (← links)
- Optimal rules for the sequential selection of monotone subsequences of maximum expected length (Q1854796) (← links)
- The BRS-inequality and its applications (Q2039762) (← links)
- Asymptotics and renewal approximation in the online selection of increasing subsequence (Q2040096) (← links)
- Asymptotic expansions and strategies in the online increasing subsequence problem (Q2230576) (← links)
- An unexpected limit of expected values (Q2371311) (← links)
- Choosing joint distributions so that the variance of the sum is small (Q2507742) (← links)
- Quickest online selection of an increasing subsequence of specified size (Q2820269) (← links)
- Markov Decision Problems Where Means Bound Variances (Q2931706) (← links)
- Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence (Q3103629) (← links)
- Smallest-fit selection of random sizes under a sum constraint: weak convergence and moment comparisons (Q4257256) (← links)
- Sequential selection of random vectors under a sum constraint (Q4819442) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays (Q5364222) (← links)
