A computationally efficient universal OCRS with preselected order achieves near-optimal (α,(1−ε)α) balance for all matroids and all α-uncontentious correlated priors, via LP duality and subsampling.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Universal Online Contention Resolution with Preselected Order
A computationally efficient universal OCRS with preselected order achieves near-optimal (α,(1−ε)α) balance for all matroids and all α-uncontentious correlated priors, via LP duality and subsampling.