A simple optimal contention resolution scheme for uniform matroids

DOI10.1016/j.tcs.2022.10.042OpenAlexW3183593772MaRDI QIDQ2699957

Richard Santiago, Danish Kashaev

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.11992

zbMATH Keywords

uniform matroidsrounding algorithmscontention resolution schemes

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
• Price of Correlations in Stochastic Optimization
• Online Contention Resolution Schemes
• Tight Approximation Bounds for Maximum Multi-coverage
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple optimal contention resolution scheme for uniform matroids