34 citations · 78 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.AI2017★ 34 cited
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…
cs.DS2017★ 2 cited
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…