The BRS-inequality and its applications
From MaRDI portal
Publication:2039762
DOI10.1214/20-PS351zbMath1475.60043arXiv2007.05358MaRDI QIDQ2039762
Publication date: 5 July 2021
Published in: Probability Surveys (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.05358
stopping timeBorel-Cantelli lemmaknapsack problemPoisson processselection biasKnapsack problemrandom sumoptimal selectionmonotone subsequenceWald's lemmageneral point processonline selectionresource dependent branching process
Related Items
Galton--Watson Processes and Their Role as Building Blocks for Branching Processes ⋮ The Bruss–Robertson–Steele inequality
Cites Work
- Unnamed Item
- Unnamed Item
- Limits of any society
- 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
- On an interval splitting problem
- Optimal sequential selection of a monotone sequence from a random sample
- Complete answer to an interval splitting problem
- Sharp bounds for \(L\)-statistics from dependent samples of random length
- Resource dependent branching processes and the envelope of societies
- Quickest online selection of an increasing subsequence of specified size
- Sequential selection of a monotone subsequence from a random permutation
- The Surprising Mathematics of Longest Increasing Subsequences
- Compressible Distributions for High-Dimensional Statistics
- Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence
- A note on extinction criteria for bisexual Galton-Watson processes
- ‘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
- On Gaussian MACs With Variable-Length Feedback and Non-Vanishing Error Probabilities
- An adaptive O(log n)‐optimal policy for the online selection of a monotone subsequence from a random sample
- Optimal selection of stochastic intervals under a sum constraint
- Sequential selection of random vectors under a sum constraint
- Sequential selection of an increasing subsequence from a sample of random size
- Impact of Correlated Neural Activity on Decision-Making Performance
- The Bruss-Robertson Inequality:Elaborations, Extensions, and Applications
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays
