16 citations · 55 across the 12 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.GT2019
The Ad Types Problem
Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers +1
The Ad Types Problem (without gap rules) is a special case of the assignment problem in which there are types of nodes on one side (the ads), and an ordered set of nodes on the…
cs.DS2019
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…