Limitations of Stochastic Selection Problems with Pairwise Independent Priors
Shaddin Dughmi, Yusuf Hakan Kalayci, Neel Patel
2024年份
4被引次数
2顶会引用
摘要
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.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper2
- On Robustness to k-Wise Independence of Optimal Bayesian MechanismsNick Gravin, Zhiqi WangFOCS 2024 · 被引用 4 次
- Online Combinatorial Optimization with Graphical DependenciesZhimeng Gao, Evangelia Gergatsouli, Kalen Patton, Sahil SinglaSTOC 2026 · 被引用 2 次
相关 Paper
- Nearly Tight Sample Complexity for Matroid Online Contention ResolutionMoran Feldman, Ola Svensson, Rico ZenklusenSODA 2026 · 被引用 1 次
- Simple and Optimal Greedy Online Contention Resolution SchemesVasilis LivanosNeurIPS 2022 · 被引用 1 次
- Single-Sample Prophet Inequalities via Greedy-Ordered SelectionConstantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco 等SODA 2022 · 被引用 12 次
- Prophet Secretary and Matching: the Significance of the Largest ItemZiyun Chen, Zhiyi Huang, Dongchen Li, Zhihao Gavin TangSODA 2025 · 被引用 1 次
- Combinatorial Stationary Prophet InequalitiesNeel Patel, David WajcSODA 2024 · 被引用 2 次
