4 citations · 28 across the 18 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
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…
cs.DS2024
Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
Will Ma, Calum MacRury, Pranav Nuti
We study the performance of sequential contention resolution and matching algorithms on random graphs with vanishing edge probabilities. When the edges of the graph are processed i…
cs.GT2024
Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions
Will Ma, Calum MacRury, Jingwei Zhang
We study the Network Revenue Management (NRM) and Online Combinatorial Auctions (OCA) problems, in which products composed of up to L resources are allocated in an online fashion.…