Rad Niazadeh | DeepAI

AI Chat

Featured Co-authors

Sébastien Bubeck
54 publications
S. Matthew Weinberg
44 publications
Zhiyi Huang
42 publications
Moses Charikar
42 publications
Tim Roughgarden
38 publications
Nima Anari
29 publications
Jon Schneider
28 publications
Renato Paes Leme
27 publications
Amin Saberi
23 publications
Yuval Emek
21 publications
Negin Golrezaei
21 publications

∙ 11/29/2022

Batching and Optimal Multi-stage Bipartite Allocations

In several applications of real-time matching of demand to supply in onl...

0 Yiding Feng, et al. ∙

∙ 10/21/2022

Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing

Matching and pricing are two critical levers in two-sided marketplaces t...

0 Yiding Feng, et al. ∙

∙ 10/20/2022

Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual

Motivated by applications in cloud computing spot markets and selling ba...

0 Farbod Ekbatani, et al. ∙

∙ 07/18/2022

Bernoulli Factories for Flow-Based Polytopes

We construct explicit combinatorial Bernoulli factories for the class of...

0 Rad Niazadeh, et al. ∙

∙ 03/02/2022

Descending Price Auctions with Bounded Number of Price Levels and Batched Prophet Inequality

We consider descending price auctions for selling m units of a good to u...

0 Saeed Alaei, et al. ∙

∙ 10/13/2021

Online Bipartite Matching with Reusable Resources

We study the classic online bipartite matching problem with a twist: off...

0 Steven Delong, et al. ∙

∙ 02/18/2021

Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization

Motivated by online decision-making in time-varying combinatorial enviro...

0 Rad Niazadeh, et al. ∙

∙ 02/02/2021

Fair Dynamic Rationing

We study the allocative challenges that governmental and nonprofit organ...

0 Vahideh Manshadi, et al. ∙

∙ 11/07/2020

Combinatorial Bernoulli Factories: Matchings, Flows and Other Polytopes

A Bernoulli factory is an algorithmic procedure for exact sampling of ce...

0 Rad Niazadeh, et al. ∙

∙ 05/04/2020

Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes

In this paper, a rather general online problem called dynamic resource a...

0 Yuval Emek, et al. ∙

∙ 05/04/2020

No-Regret Stateful Posted Pricing

In this paper, a rather general online problem called dynamic resource a...

0 Yuval Emek, et al. ∙

∙ 02/21/2020

Ranking an Assortment of Products via Sequential Submodular Optimization

We study an optimization problem capturing a core operational question f...

0 Arash Asadpour, et al. ∙

∙ 09/23/2019

Persuasion and Incentives Through the Lens of Duality

Lagrangian duality underlies both classical and modern mechanism design....

0 Shaddin Dughmi, et al. ∙

∙ 12/27/2018

Hierarchical Clustering for Euclidean Data

Recent works on Hierarchical Clustering (HC), a well-studied problem in ...

0 Moses Charikar, et al. ∙

∙ 08/07/2018

Hierarchical Clustering better than Average-Linkage

Hierarchical Clustering (HC) is a widely studied problem in exploratory ...

0 Moses Charikar, et al. ∙

∙ 07/15/2018

Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection

We study online pricing algorithms for the Bayesian selection problem wi...

0 Nima Anari, et al. ∙

∙ 05/24/2018

Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization

In this paper we study the fundamental problems of maximizing a continuo...

0 Rad Niazadeh, et al. ∙

∙ 05/24/2018

Hierarchical Clustering with Structural Constraints

Hierarchical clustering is a popular unsupervised data analysis method. ...

0 Vaggos Chatziafratis, et al. ∙

∙ 05/26/2017

Online Auctions and Multi-scale Online Learning

We consider revenue maximization in online auctions and pricing. A selle...

0 Sébastien Bubeck, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world