2 papers
cs.DS2026
Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes
Brian Brubach, Nathaniel Grammel, Will Ma +2
Matching is one of the most fundamental and broadly applicable problems across many domains. In these diverse real-world applications, there is often a degree of uncertainty in the…
cs.DS2024
Proportionally Fair Matching via Randomized Rounding
Sharmila Duppala, Nathaniel Grammel, Juan Luque +2
Given an edge-colored graph, the goal of the proportional fair matching problem is to find a maximum weight matching while ensuring proportional representation (with respect to the…