15 citations · 28 across the 13 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021
Periodic Reranking for Online Matching of Reusable Resources
Rajan Udwani
We consider a generalization of the vertex weighted online bipartite matching problem where the offline vertices, called resources, are reusable. In particular, when a resource is…
cs.DS2021
Adwords with Unknown Budgets and Beyond
Rajan Udwani
In the classic Adwords problem introduced by Mehta et al.\ (2007), we have a bipartite graph between advertisers and queries. Each advertiser has a maximum budget that is known a p…
math.OC2021★ 7 cited
Submodular Order Functions and Assortment Optimization
Rajan Udwani
We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground…