Pairwise-Independent Contention Resolution

June 22, 2024 Β· Declared Dead Β· πŸ› Conference on Integer Programming and Combinatorial Optimization

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Anupam Gupta, Jinqiao Hu, Gregory Kehne, Roie Levin arXiv ID 2406.15876 Category cs.DS: Data Structures & Algorithms Citations 9 Venue Conference on Integer Programming and Combinatorial Optimization Last Checked 4 months ago
Abstract
We study online contention resolution schemes (OCRSs) and prophet inequalities for non-product distributions. Specifically, when the active set is sampled according to a pairwise-independent (PI) distribution, we show a $(1-o_k(1))$-selectable OCRS for uniform matroids of rank $k$, and $Ξ©(1)$-selectable OCRSs for laminar, graphic, cographic, transversal, and regular matroids. These imply prophet inequalities with the same ratios when the set of values is drawn according to a PI distribution. Our results complement recent work of Dughmi, Kalayci, and Patel (STOC '24) showing that no $Ο‰(1/k)$-selectable OCRS exists in the PI setting for general matroids of rank $k$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted