Improved Online Contention Resolution Schemes for Matching Polytopes in Graphs

This paper analyzes online contention resolution schemes (OCRS) and random-order contention resolution schemes (RCRS) for resource constraints defined by matchings in graphs. The authors improve the state-of-the-art algorithmic guarantees and derive new impossibility results for these schemes.