Oblivious Online Contention Resolution Schemes

@article{Fu2022ObliviousOC,
  title={Oblivious Online Contention Resolution Schemes},
  author={Hu Fu and Pinyan Lu and Zhihao Gavin Tang and Abner Turkieltaub and Hongxun Wu and Jinzhao Wu and Qianfan Zhang},
  journal={ArXiv},
  year={2022},
  volume={abs/2111.10607}
}
  • Hu Fu, Pinyan Lu, +4 authors Qianfan Zhang
  • Published 20 November 2021
  • Computer Science
  • ArXiv
Contention resolution schemes (CRSs) are powerful tools for obtaining “ex post feasible” solutions from candidates that are drawn from “ex ante feasible” distributions. Online contention resolution schemes (OCRSs), the online version, have found myriad applications in Bayesian and stochastic problems, such as prophet inequalities and stochastic probing. When the ex ante distribution is unknown, it was unknown whether good CRSs/OCRSs exist with no sample (in which case the scheme is oblivious… 
1 Citations

Figures from this paper

A Simple and Tight Greedy OCRS
TLDR
This work gives simple 1/e selectable greedy OCRSs for rank-1 matroids, partitionMatroids and transversal matroIDS, and shows that the greedyOCRSs are optimal, even for the simple single-item case.

References

SHOWING 1-10 OF 26 REFERENCES
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities
TLDR
The first optimal $1/2$-OCRS for matroids is designed by reducing the problem to designing a matroid prophet inequality where it is compared to the stronger benchmark of an ex-ante relaxation.
Online Contention Resolution Schemes
TLDR
A new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context of submodular function maximization, and the first constant-factor algorithm for weighted stochastic probing with deadlines are introduced.
Random Order Contention Resolution Schemes
TLDR
The main application of the framework is a k + 4 + epsilon approximation ratio for the Bayesian multi-parameter unit-demand mechanism design under the constraint of k matroids intersection, which improves upon the previous bounds of 4k – 2 and e(k + 1).
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem
TLDR
This paper characterize the distributions for which offline contention resolution is possible, and establishes some of their basic closure properties, and can be interpreted as a distributional generalization of the matroid covering theorem.
Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications
TLDR
These results are the first non-trivial results for random order prophet matching and Price-of-Information matching in general graphs.
An Optimal Monotone Contention Resolution Scheme for Bipartite Matchings via a Polyhedral Viewpoint
TLDR
This work suggests a different, polyhedral viewpoint to design contention resolution schemes, which avoids to deal explicitly with the randomization in the second step, and derives a monotone contention resolution scheme for matchings that significantly improves over the previously best one.
Matroid Secretary is Equivalent to Contention Resolution
TLDR
It is shown that universal random-order contention resolution for matroids, in the usual setting of a fully known prior distribution, suffices to resolve the matroid secretary conjecture in the affirmative.
Submodular function maximization via the multilinear relaxation and contention resolution schemes
TLDR
A broadly applicable framework for maximizing linear and submodular functions subject to independence constraints is developed and it is shown that contention resolution schemes are an effective way to round a fractional solution, even when f is non-monotone.
A Stochastic Probing Problem with Applications
TLDR
The first polynomial-time Ω(1/k)-approximate "Sequential Posted Price Mechanism" under k-matroid intersection feasibility constraints is obtained, improving on prior work.
The sample complexity of revenue maximization
TLDR
It is shown that the only way to achieve a sufficiently good constant approximation of the optimal revenue is through a detailed understanding of bidders' valuation distributions, and introduces α-strongly regular distributions, which interpolate between the well-studied classes of regular and MHR distributions.
...
1
2
3
...