activity
20102026
most citedOn the Achievability of Cramér-Rao Bound In Noisy Compressed Sensing

45 citations · 204 across the 40 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

cs.DS2022★ 7 cited

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…

cs.DS2022★ 4 cited

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…

cs.DS2022

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…

cs.DS2022

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…

cs.GT2022

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…