34 citations · 150 across the 33 of their papers we have counts for
4 papers · 1 filter
Online minimum matching with uniform metric and random arrivals
Sharmila Duppala, Karthik A. Sankararaman, Pan Xu
We consider Online Minimum Bipartite Matching under the uniform metric. We show that Randomized Greedy achieves a competitive ratio equal to , which matches th…
Matching Algorithms for Blood Donation
Duncan C McElfresh, Christian Kroer, Sergey Pupyrev +5
Global demand for donated blood far exceeds supply, and unmet need is greatest in low- and middle-income countries; experts suggest that large-scale coordination is necessary to al…
Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising
Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi +2
We study the problem of an online advertising system that wants to optimally spend an advertiser's given budget for a campaign across multiple platforms, without knowing the value…
Beyond Regret for Decentralized Bandits in Matching Markets
Soumya Basu, Karthik Abinav Sankararaman, Abishek Sankararaman
We design decentralized algorithms for regret minimization in the two-sided matching market with one-sided bandit feedback that significantly improves upon the prior works (Liu et…