• Corpus ID: 252439177

Simple and Optimal Greedy Online Contention Resolution Schemes

@inproceedings{Livanos2021SimpleAO,
  title={Simple and Optimal Greedy Online Contention Resolution Schemes},
  author={Vasilis Livanos},
  year={2021}
}
  • V. Livanos
  • Published 25 November 2021
  • Computer Science, Mathematics
Real-world problems such as ad allocation and matching have been extensively studied under the lens of combinatorial optimization. In several applications, uncertainty in the input appears naturally and this has led to the study of online stochastic optimization models for such problems. For the offline case, these constrained combinatorial optimization problems have been extensively studied, and Contention Resolution Schemes (CRSs), introduced by Chekuri, Vondr´ak, and Zenklusen, have emerged in… 

References

SHOWING 1-10 OF 58 REFERENCES

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.

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.

Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models

TLDR
A novel unified framework of batched prophet inequalities is introduced that captures online settings where elements arrive in batches; in particular it captures matching under the two well-studied arrival models, namely edge arrival and vertex arrival.

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 of a dropping procedure, and derives a monotone contention resolution scheme for matchings that significantly improves over the previously best one.

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).

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.

Delegated Pandora's Box

TLDR
This work considers the delegation gap of the generalized Pandora's box problem, a search problem in which searching for solutions incurs known costs and solutions are restricted by some downward-closed constraint, and shows that there is no constant-factor delegation gap for simple non-binary instances of the problem.

Oblivious Online Contention Resolution Schemes

TLDR
This work gives a simple 1 e -selectable oblivious single item OCRS by mixing two simple schemes evenly, and shows, via a Ramsey theory argument, that it is optimal and no CRS or OCRS with O(1) samples can be Ω(1)-balanced/selectable.

On Submodular Prophet Inequalities and Correlation Gap

TLDR
Improved constant factor combinatorial prophet inequalities for both monotone and non-monotone submodular functions over any constraint that admits an Online Contention Resolution Scheme are obtained and efficient polynomial-time algorithms are described that achieve these bounds.

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes

TLDR
This work provides a 0.382-approximate algorithm for stochastic matching with patience constraints in general graphs and presents new ordered contention resolution schemes yielding improved approximation guarantees for some of the foundational problems studied in this area.
...