Rad Niazadeh

University of Chicago - Booth School of Business

Assistant Professor

5807 S Woodlawn Ave

Chicago, IL 60637

http://https://faculty.chicagobooth.edu/rad-niazadeh

SCHOLARLY PAPERS

18

DOWNLOADS
Rank 12,814

SSRN RANKINGS

Top 12,814

in Total Papers Downloads

6,222

SSRN CITATIONS
Rank 29,159

SSRN RANKINGS

Top 29,159

in Total Papers Citations

23

CROSSREF CITATIONS

9

Ideas:
“  I study the interplay between algorithms (for computation), data (for learning), and incentives (for modeling strategic behavior) in real-time operations management. My primary research goal is to develop and advance the modern theoretical methodologies used by market algorithms/mechanisms in dynamic and complex environments. I leverage the theory to address various operational challenges in practice, ranging from designing computationally and economically efficient (or profitable) online marketplaces, to designing socially-aware decision making policies (for equity, fairness, and non-discrimination) in operations of governmental agencies and non-profit organizations.  ”

Scholarly Papers (18)

1.

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

Chicago Booth Research Paper No. 20-27
Number of pages: 87 Posted: 25 Jun 2020 Last Revised: 06 Feb 2023
University of Chicago - Booth School of Business, Massachusetts Institute of Technology (MIT) - Sloan School of Management, Google Inc. - Google Research Mountain View, Massachusetts Institute of Technology (MIT) - Sloan School of Management and Google Inc. - Google Research Mountain View
Downloads 1,057 (34,015)
Citation 4

Abstract:

Loading...

Online learning, submodular optimization, revenue management, Blackwell approachability

2.

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

Chicago Booth Research Paper No. 20-28
Number of pages: 58 Posted: 22 Jul 2020 Last Revised: 25 Jan 2022
Yiding Feng, Rad Niazadeh and Amin Saberi
Microsoft Corporation - Microsoft Research New England, University of Chicago - Booth School of Business and Stanford University - Department of Management Science & Engineering
Downloads 886 (43,516)
Citation 7

Abstract:

Loading...

Online matching, Ride hailing, Pricing

3.

Batching and Optimal Multi-stage Bipartite Allocations

Chicago Booth Research Paper No. 20-29
Number of pages: 49 Posted: 10 Sep 2020 Last Revised: 01 Dec 2022
Yiding Feng and Rad Niazadeh
Microsoft Corporation - Microsoft Research New England and University of Chicago - Booth School of Business
Downloads 654 (65,350)
Citation 3

Abstract:

Loading...

Online algorithms, Matching, Batching, Online allocations, Ad allocation

4.

Linear Programming Based Online Policies for Real-Time Assortment of Reusable Resources

Chicago Booth Research Paper No. 20-25
Number of pages: 64 Posted: 17 Jul 2019 Last Revised: 11 Sep 2020
Yiding Feng, Rad Niazadeh and Amin Saberi
Microsoft Corporation - Microsoft Research New England, University of Chicago - Booth School of Business and Stanford University - Department of Management Science & Engineering
Downloads 611 (71,345)
Citation 7

Abstract:

Loading...

real-time assortment; reusable resources; revenue management; online algorithms

5.

Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization

Chicago Booth Research Paper No. 21-17. An earlier version of this paper was circulated under the title "Near-Optimal Experimental Design for Networks: Independent Block Randomization."
Number of pages: 66 Posted: 01 Jun 2021 Last Revised: 22 Mar 2023
Ozan Candogan, Chen Chen and Rad Niazadeh
University of Chicago - Booth School of Business, New York University (NYU) - New York University (NYU), Shanghai and University of Chicago - Booth School of Business
Downloads 527 (85,771)

Abstract:

Loading...

Variance minimization, robust optimization, experimental design, cluster-based randomization, approximation algorithms, asymptotic optimality.

6.

Near-Optimal Bayesian Online Assortment of Reusable Resources

Chicago Booth Research Paper No. 20-40
Number of pages: 50 Posted: 21 Oct 2020 Last Revised: 10 May 2022
Yiding Feng, Rad Niazadeh and Amin Saberi
Microsoft Corporation - Microsoft Research New England, University of Chicago - Booth School of Business and Stanford University - Department of Management Science & Engineering
Downloads 461 (101,029)
Citation 5

Abstract:

Loading...

Assortment optimization, Online assortment, Reusable resources, Competitive analysis, Online algorithms

7.

Fair Dynamic Rationing

Number of pages: 67 Posted: 02 Feb 2021 Last Revised: 20 Jun 2022
Vahideh Manshadi, Rad Niazadeh and Scott Rodilitz
Yale School of Management, University of Chicago - Booth School of Business and University of California, Los Angeles (UCLA) - Anderson School of Management
Downloads 331 (147,293)

Abstract:

Loading...

rationing, fair allocation, social goods, correlated demands, online resource allocation

8.

Sequential Submodular Maximization and Applications to Ranking an Assortment of Products

Chicago Booth Research Paper No. 20-26
Number of pages: 49 Posted: 18 Mar 2020 Last Revised: 25 Jan 2022
City University of New York, University of Chicago - Booth School of Business, Stanford University - Department of Management Science & Engineering and Stanford University, Management Science & Engineering
Downloads 316 (154,214)
Citation 1

Abstract:

Loading...

Product Ranking, Submodular Maximization, Online Platforms, Online Retail, Group Fairness

9.

Online Assortment of Reusable Resources with Exogenous Replenishment

Number of pages: 37 Posted: 02 Mar 2021
Yiding Feng, Rad Niazadeh and Amin Saberi
Microsoft Corporation - Microsoft Research New England, University of Chicago - Booth School of Business and Stanford University - Department of Management Science & Engineering
Downloads 260 (188,611)

Abstract:

Loading...

10.

Fair Markovian Search

Number of pages: 38 Posted: 06 Feb 2023 Last Revised: 13 Apr 2023
University of Chicago - Booth School of Business, Yale School of Management and University of Chicago - Booth School of Business
Downloads 208 (234,761)

Abstract:

Loading...

Sequential Search, Algorithmic Fairness, Pandora's Box, Joint Markov Scheduling, Primal-Dual Algorithms

11.

Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection

Chicago Booth Research Paper No. 20-24
Number of pages: 31 Posted: 05 Aug 2019 Last Revised: 11 Sep 2020
Nima Anari, Rad Niazadeh, Amin Saberi and Ali Shameli
Stanford University - Computer Science Department, University of Chicago - Booth School of Business, Stanford University - Department of Management Science & Engineering and Stanford University, Management Science & Engineering
Downloads 174 (274,121)

Abstract:

Loading...

Bayesian online selection; Prophet inequalities; PTAS; Dynamic programming

12.

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

Number of pages: 45 Posted: 19 Oct 2022
Farbod Ekbatani, Yiding Feng and Rad Niazadeh
University of Chicago - Booth School of Business, Microsoft Corporation - Microsoft Research New England and University of Chicago - Booth School of Business
Downloads 168 (282,557)

Abstract:

Loading...

Buyback problem, recalling resources, online resource allocation, primal-dual

13.

Combinatorial Bernoulli Factories: Matchings, Flows and Other Polytopes

Number of pages: 41 Posted: 13 Jan 2021
Rad Niazadeh, Renato Paes Leme and Jon Schneider
University of Chicago - Booth School of Business, Google Inc. and Google Inc., New York
Downloads 131 (345,581)

Abstract:

Loading...

Bernoulli factories; Exact sampling; Exact simulation; Geometric combinatorics

14.

Optimal Multi-stage Configuration Allocation with Applications to Video Advertising

Number of pages: 25 Posted: 20 Sep 2021
Yiding Feng and Rad Niazadeh
Microsoft Corporation - Microsoft Research New England and University of Chicago - Booth School of Business
Downloads 123 (362,182)

Abstract:

Loading...

Video Advertising, Display Ads, Online Allocations, Primal-Dual, Convex Programming

15.

Fast Core Pricing for Rich Advertising Auctions

Chicago Booth Research Paper No. 20-39, Operations Research, Forthcoming
Number of pages: 51 Posted: 21 Oct 2020 Last Revised: 29 Oct 2020
University of Chicago - Booth School of Business, affiliation not provided to SSRN, Microsoft Research, Amazon and Microsoft Research
Downloads 102 (413,963)

Abstract:

Loading...

Core-Selecting Auctions, Combinatorial Auctions, Package Auctions, VCG, Advertising Auction

16.

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

Number of pages: 34 Posted: 28 Mar 2022
affiliation not provided to SSRN, Fuqua School of Business, University of Toronto - Rotman School of Management and University of Chicago - Booth School of Business
Downloads 80 (482,528)

Abstract:

Loading...

Clock auction, First price auction, Bayesian online selection, Optimal auction

17.

Learning to Rank with Limited-Attention Users

Number of pages: 24 Posted: 27 Feb 2023
Arpit Agarwal, Rad Niazadeh and Prathamesh Patil
Columbia University, University of Chicago - Booth School of Business and University of Pennsylvania
Downloads 69 (528,068)

Abstract:

Loading...

18.

Online Bipartite Matching with Reusable Resources

Number of pages: 34 Posted: 31 Oct 2022
Google Inc., Carnegie Mellon University - School of Computer Science, University of Chicago - Booth School of Business, Google Inc., New York and UC Berkeley
Downloads 64 (545,079)

Abstract:

Loading...

Online resource allocation, matching, reusable resources, revenue management