Limitations of Stochastic Selection Problems with Pairwise Independent Priors
Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel
Abstract
Motivated by the growing interest in correlation-robust stochastic optimization, we investigate stochastic selection problems beyond independence. Specifically, we consider the instructive case of pairwise-independent priors and matroid constraints. We obtain essentially-optimal bounds for contention resolution and prophet inequalities. The impetus for our work comes from the recent work of Caragiannis et. al. [WINE 2022], who derived a constant factor approximation for the single-choice prophet inequality with pairwise-independent priors.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get e96e9195-1b04-4449-b816-ab39afdda2a1Cited by top-tier papers2
- On Robustness to k-Wise Independence of Optimal Bayesian MechanismsNick Gravin, Zhiqi WangFOCS 2024 · 4 citations
- Online Combinatorial Optimization with Graphical DependenciesZhimeng Gao, Evangelia Gergatsouli, Kalen Patton, Sahil SinglaSTOC 2026 · 2 citations
Related papers
- Nearly Tight Sample Complexity for Matroid Online Contention ResolutionMoran Feldman, Ola Svensson, Rico ZenklusenSODA 2026 · 1 citation
- Simple and Optimal Greedy Online Contention Resolution SchemesVasilis LivanosNeurIPS 2022 · 1 citation
- Single-Sample Prophet Inequalities via Greedy-Ordered SelectionConstantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco et al.SODA 2022 · 12 citations
- Prophet Secretary and Matching: the Significance of the Largest ItemZiyun Chen, Zhiyi Huang, Dongchen Li, Zhihao Gavin TangSODA 2025 · 1 citation
- Combinatorial Stationary Prophet InequalitiesNeel Patel, David WajcSODA 2024 · 2 citations
