A simple optimal contention resolution scheme for uniform matroids
From MaRDI portal
Recommendations
Cites work
- An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
- Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 6783427 (Why is no real title available?)
- Online contention resolution schemes
- Optimal online contention resolution schemes via ex-ante prophet inequalities
- Price of correlations in stochastic optimization
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- The submodular welfare problem with demand queries
- Tight approximation bounds for maximum multi-coverage
- Understanding the correlation gap for matchings
Cited in
(4)
This page was built for publication: A simple optimal contention resolution scheme for uniform matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2699957)
