45 citations · 204 across the 40 of their papers we have counts for
5 papers · 1 filter
Dynamic Matching with Abandonment: Optimal Guarantees via Static Priority Policies
Nick Arnosti, Rad Niazadeh, Pranav Nuti +1
We study stochastic dynamic matching with abandonment, a fundamental model in which agents of different types arrive over time, may abandon the market while waiting, and can be mat…
Modern Primal-Dual Frameworks for Prior-Free Online Resource Allocation
Rad Niazadeh, Rajan Udwani
Linear-programming (LP)-based primal-dual methods are fundamental for designing and analyzing algorithms in adversarial (prior-free) online resource allocation. This chapter provid…
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…
Stationary Online Contention Resolution Schemes: Theory and Applications to Bayesian Online Resource Allocation
Mohammad Reza Aminian, Rad Niazadeh, Pranav Nuti
Motivated by problems in Bayesian reusable resource allocation, we introduce the concept of stationary online contention resolution schemes (S-OCRSs). OCRSs are a central tool used…