activity
20152022
most citedHierarchical Clustering for Euclidean Data

15 citations · 42 across the 8 of their papers we have counts for

collaborators

12 papers

cs.DS20227 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.DS20224 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.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…

cs.GT20205 cited

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…

cs.GT2019

Persuasion and Incentives Through the Lens of Duality

Shaddin Dughmi, Rad Niazadeh, Alexandros Psomas +1

Lagrangian duality underlies both classical and modern mechanism design. In particular, the dual perspective often permits simple and detail-free characterizations of optimal and a…

cs.DS201815 cited

Hierarchical Clustering for Euclidean Data

Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh +1

Recent works on Hierarchical Clustering (HC), a well-studied problem in exploratory data analysis, have focused on optimizing various objective functions for this problem under arb…