12 papers
Stationary Online Contention Resolution Schemes
Mohammad Reza Aminian, Rad Niazadeh, Pranav Nuti
The paper introduces stationary online contention resolution schemes (S‑OCRSs), a permutation‑invariant class of OCRSs with a distributional characterization, and uses a maximum‑en…
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, Mehdi Golari +10
Ride-hailing platforms increasingly rely on non-exclusive notifications-broadcasting a single request to multiple drivers simultaneously-to mitigate inefficiencies caused by uncert…
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 'exclusive dispatch (ED)' less efficient: rejections and timeouts force seq…
Near-Optimal Bayesian Online Assortment of Reusable Resources
Yiding Feng, Rad Niazadeh, Amin Saberi
Motivated by the applications of rental services in e-commerce, we consider revenue maximization in online assortment of reusable resources for a stream of arriving consumers with…
Robustness of Online Inventory Balancing to Inventory Shocks
Yiding Feng, Rad Niazadeh, Amin Saberi
In classic adversarial online resource allocation problems such as AdWords, customers arrive online while products are given offline with a fixed initial inventory. To ensure reven…