4 citations · 33 across the 44 of their papers we have counts for
3 papers · 1 filter
Online Bipartite Matching with Reusable Resources
Steven Delong, Alireza Farhadi, Rad Niazadeh +2
We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are . In particular, when a resource is matched to an on…
Variable Decomposition for Prophet Inequalities and Optimal Ordering
Allen Liu, Renato Paes Leme, Martin Pal +2
We introduce a new decomposition technique for random variables that maps a generic instance of the prophet inequalities problem to a new instance where all but a constant number o…
Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan +1
We present prior robust algorithms for a large class of resource allocation problems where requests arrive one-by-one (online), drawn independently from an unknown distribution at…