2 papers
cs.DS2018
Maximum Weight Online Matching with Deadlines
Itai Ashlagi, Maximilien Burq, Chinmoy Dutta +3
We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace.…
cs.DS2018
Online Matching in a Ride-Sharing Platform
Chinmoy Dutta, Chris Sholley
We propose a formal graph-theoretic model for studying the problem of matching rides online in a ride-sharing platform. Unlike most of the literature on online matching, our model,…