English

Pairwise-Independent Contention Resolution

Data Structures and Algorithms 2024-06-25 v1

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 (1ok(1))(1-o_k(1))-selectable OCRS for uniform matroids of rank kk, and Ω(1)\Omega(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)\omega(1/k)-selectable OCRS exists in the PI setting for general matroids of rank kk.

Cite

@article{arxiv.2406.15876,
  title  = {Pairwise-Independent Contention Resolution},
  author = {Anupam Gupta and Jinqiao Hu and Gregory Kehne and Roie Levin},
  journal= {arXiv preprint arXiv:2406.15876},
  year   = {2024}
}

Comments

Contains new results on t-wise independent CRSs

R2 v1 2026-06-28T17:15:56.397Z