34 citations · 150 across the 33 of their papers we have counts for
3 papers · 2 filters
Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity
John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan +1
In bipartite matching problems, vertices on one side of a bipartite graph are paired with those on the other. In its online variant, one side of the graph is available offline, whi…
Adversarial Bandits with Knapsacks
Nicole Immorlica, Karthik Abinav Sankararaman, Robert Schapire +1
We consider Bandits with Knapsacks (henceforth, BwK), a general model for multi-armed bandits under supply/budget constraints. In particular, a bandit algorithm needs to solve a we…
Attenuate Locally, Win Globally: An Attenuation-based Framework for Online Stochastic Matching with Timeouts
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan +1
Online matching problems have garnered significant attention in recent years due to numerous applications in e-commerce, online advertisements, ride-sharing, etc. Many of them capt…