34 citations · 150 across the 33 of their papers we have counts for
3 papers · 1 filter
Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources
John P Dickerson, Karthik A Sankararaman, Aravind Srinivasan +1
Bipartite matching markets pair agents on one side of a market with agents, items, or contracts on the opposing side. Prior work addresses online bipartite matching markets, where…
Algorithms to Approximate Column-Sparse Packing Problems
Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan +1
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and mu…
Combinatorial Semi-Bandits with Knapsacks
Karthik Abinav Sankararaman, Aleksandrs Slivkins
We unify two prominent lines of work on multi-armed bandits: bandits with knapsacks (BwK) and combinatorial semi-bandits. The former concerns limited "resources" consumed by the al…