45 citations · 204 across the 40 of their papers we have counts for
44 papers
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…
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…
Robust Dynamic Staffing with Predictions
Yiding Feng, Vahideh Manshadi, Rad Niazadeh +1
We consider a natural dynamic staffing problem in which a decision-maker sequentially hires workers over a finite horizon to meet an unknown demand revealed at the end. Predictions…
Online Job Assignment
Farbod Ekbatani, Yiding Feng, Ian Kash +1
Motivated primarily by applications in cloud computing, we study a simple, yet powerful, online allocation problem in which jobs of varying durations arrive over continuous time an…
Markovian Search with Ex-Ante Constraints: Theory and Applications to Socially Aware Algorithmic Hiring
Mohammad Reza Aminian, Vahideh Manshadi, Rad Niazadeh
We develop an algorithmic framework to incorporate "ex-ante" constraints on outcomes (that hold only on average) into stateful sequential search with costly inspection. Our framewo…
Dynamic Matching with Post-allocation Service and its Application to Refugee Resettlement
Kirk Bansak, Soonbong Lee, Vahideh Manshadi +2
Motivated by our collaboration with a major refugee resettlement agency in the U.S., we study a dynamic matching problem where each new arrival (a refugee case) must be matched imm…
Prophet Inequalities with Cancellation Costs
Farbod Ekbatani, Rad Niazadeh, Pranav Nuti +1
Most of the literature on online algorithms and sequential decision-making in revenue management focuses on settings with irrevocable decisions. Motivated by modern applications su…
Misalignment, Learning, and Ranking: Harnessing Users Limited Attention
Arpit Agarwal, Rad Niazadeh, Prathamesh Patil
In digital health and EdTech, recommendation systems face a significant challenge: users often choose impulsively, in ways that conflict with the platform's long-term payoffs. This…
Batching and Optimal Multi-stage Bipartite Allocations
Yiding Feng, Rad Niazadeh
In several applications of real-time matching of demand to supply in online marketplaces, the platform allows for some latency to batch the demand and improve the efficiency. Motiv…
Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing
Yiding Feng, Rad Niazadeh, Amin Saberi
Matching and pricing are two critical levers in two-sided marketplaces to connect demand and supply. The platform can produce more efficient matching and pricing decisions by batch…
Online Resource Allocation with Cancellations
Farbod Ekbatani, Yiding Feng, Rad Niazadeh
We initiate the study of two-sided online resource allocation with costly cancellations within the buyback model. Our focus is on edge-weighted online matching and several of its e…
Bernoulli Factories for Flow-Based Polytopes
Rad Niazadeh, Renato Paes Leme, Jon Schneider
We construct explicit combinatorial Bernoulli factories for the class of \emph{flow-based polytopes}; integral 0/1-polytopes defined by a set of network flow constraints. This gene…
Descending Price Auctions with Bounded Number of Price Levels and Batched Prophet Inequality
Saeed Alaei, Ali Makhdoumi, Azarakhsh Malekian +1
We consider descending price auctions for selling units of a good to unit demand i.i.d. buyers where there is an exogenous bound of on the number of price levels the auctio…
Online Bipartite Matching with Reusable Resources
Steven Delong, Alireza Farhadi, Rad Niazadeh +2
We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are . In particular, when a resource is matched to an on…
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
Rad Niazadeh, Negin Golrezaei, Joshua Wang +2
Motivated by online decision-making in time-varying combinatorial environments, we study the problem of transforming offline algorithms to their online counterparts. We focus on of…
Fair Dynamic Rationing
Vahideh Manshadi, Rad Niazadeh, Scott Rodilitz
We study the allocative challenges that governmental and nonprofit organizations face when tasked with equitable and efficient rationing of a social good among agents whose needs (…
Combinatorial Bernoulli Factories
Rad Niazadeh, Renato Paes Leme, Jon Schneider
A Bernoulli factory is an algorithmic procedure for exact sampling of certain random variables having only Bernoulli access to their parameters. Bernoulli access to a parameter $p…
Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes
Yuval Emek, Ron Lavi, Rad Niazadeh +1
In this paper, a rather general online problem called dynamic resource allocation with capacity constraints (DRACC) is introduced and studied in the realm of posted price mechanism…
Sequential Submodular Maximization and Applications to Ranking an Assortment of Products
Arash Asadpour, Rad Niazadeh, Amin Saberi +1
We study a submodular maximization problem motivated by applications in online retail. A platform displays a list of products to a user in response to a search query. The user insp…