10 citations · 14 across the 4 of their papers we have counts for
4 papers
Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
Farbod Ekbatani, Rad Niazadeh, Shruti Penumatsa +11
Ride-hailing platforms increasingly rely on non-exclusive notifications--broadcasting a single request to multiple drivers simultaneously--to mitigate inefficiencies caused by unce…
Non-Exclusive Notifications for Ride-Hailing at Lyft II: Simulations and Marketplace Analysis
Farbod Ekbatani, Rad Niazadeh, Mehdi Golari +10
Ride-hailing platforms increasingly face uncertain driver acceptance, which makes traditional one-to-one \emph{exclusive dispatch} (ED) less efficient: rejections and timeouts forc…
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.…
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,…