Towards an optimal contention resolution scheme for matchings

DOI10.1007/978-3-031-32726-1_27zbMath1528.91049arXiv2211.03599OpenAlexW4377199991MaRDI QIDQ6086015

Jan Vondrák, Pranav Nuti

Publication date: 9 November 2023

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

matchingrandom graphscontention resolution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Matching models (91B68)

Cites Work

• Unnamed Item
• Unnamed Item
• Matchings on infinite graphs
• An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
• Controllability and matchings in random bipartite graphs
• Online Contention Resolution Schemes
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• On Maximizing Welfare When Utility Functions Are Subadditive

This page was built for publication: Towards an optimal contention resolution scheme for matchings