4 citations · 4 across the 3 of their papers we have counts for
4 papers
Forward-backward Contention Resolution Schemes for Fair Rationing
Will Ma, Calum MacRury, Cliff Stein
We use contention resolution schemes (CRS) to derive algorithms for the fair rationing of a single resource when agents have stochastic demands. We aim to provide ex-ante guarantee…
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…
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.…
Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals
Calum MacRury, Will Ma
We introduce a new approach for designing Random-order Contention Resolution Schemes (RCRS) via exact solution in continuous time. Given a function ,…