Rad Niazadeh
Welcome!
I am an Assistant Professor of Operations Management at the University of Chicago Booth School of Business. I am also part of the faculty at the Toyota Technological Institute at Chicago (TTIC) by a courtesy appointment. Prior to joining Chicago Booth, I was a faculty researcher at the Google Research NYC's market algorithms team, and a postdoctoral fellow at Stanford University, Computer Science. I obtained my PhD in Computer Science (minored in Applied Mathematics) from Cornell University.
My research primarily aims to build theoretical methodologies and general frameworks that help with the operations of online platforms, electronic markets, and modern non-profit organizations. The theoretical aspects of my research center around studying sequential decision-making problems arising in several complex and dynamic operational scenarios related to these domains --- and studying the interplay between algorithms, uncertainty, and strategic behavior in such applications. On the practical side, I utilize this theory to (i) design real-time market algorithms that are faster and more economically efficient and (ii) develop socially-aware decision-making policies that prioritize equity, fairness, and non-discrimination in the operations of non-profit organizations, governmental agencies, and even online platforms. Some of my current research interests are:
(i) Online algorithms and learning in revenue management and market design,
(ii) Algorithmic fairness in sequential decision-making,
(iii) Algorithmic mechanism design,
(iv) Algorithmic machine learning and data science in operations.
What's New?
[May 2023] Conference versions of two papers are accepted in EC 2023:
(i) "Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual"
(ii) "Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization"
[April 2023] I am excited to have two new principal-researchers, joining me and Vahideh Manshadi (Yale SOM), in 2023-2024!
(i) Yiding Feng (currently a postdoc at Microsoft Research)
(ii) Yueyang Zhong (currently a phd student at Chicago Booth)
[March 2023] Our paper “Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes” is accepted for publication in Mathematics of Operations Research!
[March 2023] Our paper "Online Bipartite Matching of Reusable Resources" is (conditionally/minor) accepted for publication in Mathematics of Operations Research!
[Jan 2023] New working paper "Learning to Rank with Limited-Attention Users" is out!
[Dec 2022] New working paper "Fair Markovian Search" is out!
[Oct 2022] New working paper "Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual" is out!
[Show More]
[Sept 2022] New revision/full journal version of working paper "Online Bipartite Matching of Reusable Resources" is out!
[Aug 2022] I am visiting Simons Institute's Data Driven Decision Processes program as a long-term participant in Fall 2022.
[Aug 2022] Starting from this year, I am a faculty at Toyota Technological Institute at Chicago (TTIC) by a courtesy appointment.
[July 2022] Our paper "Sequential Submodular Maximization and Applications to Ranking an Assortment of Products"is accepted for publication in Operations Research!
[July 2022] Our paper "Fair Dynamic Rationing" is accepted for publication in Management Science!
[July 2022] Our paper "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization" is accepted for publication in Management Science!
[June 2022] New revision of the working paper "Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization" is out.
[May 2022] Conference versions of four papers are accepted at EC 2022!
(i) "Descending Price Auctions with Bounded Number of Prices Levels and Batched Prophet Inequality"
(ii) "Online Bipartite Matching with Reusable Resources
(iii) "Sequential Submodular Maximization and Applications to Ranking an Assortment of Products"
(iv) "Near-optimal Bayesian Online Assortment of Reusable Resources"
[April 2022] Three papers are accepted for presentation at MSOM this year! Also our work "Fair Dynamic Rationing" is accepted for presentation at "MSOM Service SIG, 2022"!
[April 2022] Our paper "Two-stage Matching and Pricing with Applications to Ride Hailing" is accepted for publication in Operations Research!
[Feb 2022] Three new working papers are out:
(i) "Descending Price Auctions with Bounded Number of Prices Levels and Batched Prophet Inequality"
(ii) "Optimal Multi-stage Configuration Allocation with Applications to Video Advertising"
(iii) "Online Bipartite Matching with Reusable Resources"
[Feb 2022] Our paper paper "Combinatorial Bernoulli Factories" is accepted for publication in Bernoulli Journal!
[Jan 2022] New revisions of the following working papers are out:
(i) "Fair Dynamic Rationing"
(ii) "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization"
(iii) "Sequential Submodular Maximization and Applications to Ranking an Assortment of Products"
[Oct 2021] I am thrilled to win the "INFORMS Auctions and Market Design 2021 Rothkopf Junior Researcher Paper Award (First Place)" for my work "Fair Dynamic Rationing"!
[Oct 2021] Our paper "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization" is a finalist for the "2021 INFORMS Data Mining Section Best Paper"!
[June 2021] Yale Insights has covered our work (read the article)
[June 2021] Chicago Booth Review (CBR) has covered our new work! (read the article)
[May 2021] New working paper "Near-optimal Experimental Design for Networks: Independent Block Randomization" is out!
[May 2021] Three papers to be presented as spotlight talks at RM&P 2021:
(i) "Fair Dynamic Rationing"
(ii) "Two-stage Matching and Pricing with Applications to Ride Hailing"
(iii) "Near-optimal Experimental Design for Networks: Independent Block Randomization"
[May 2021] Conference versions of two papers are accepted in EC 2021:
(i) "Fair Dynamic Rationing"
(ii) "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization"
[March 2021] New revision of the working paper "Two-stage Matching and Pricing with Applications to Ride Hailing" is out!
[Feb 2021] New working paper "Online Assortment of Reusable Resources with Exogenous Replenishment" is out!
[Feb 2021] The conference version of "Combinatorial Bernoulli Factories: Matchings, Flows, and Other Polytopes" is now accepted in STOC 2021!
[Jan 2021] New working paper "Fair Dynamic Rationing" is out!
[Jan 2021] New revision of the working paper "Sequential Submodular Maximization and Applications to Ranking an Assortment of Products" is out!
[Nov 2020] New working paper "Combinatorial Bernoulli Factories: Matchings, Flows, and Other Polytopes" is out!
[Nov 2020] My paper "Bernoulli Factories and Black-Box Reductions in Mechanism Design" is now accepted in Journal of the ACM (JACM)!
[Oct 2020] Conference version of "Batching and Optimal Multi-stage Bipartite Allocations" is now accepted in ITCS 2021!
[Oct 2020] New working paper "Near-optimal Bayesian Online Assortment of Reusable Resources" is out!
[Oct 2020] My paper "Fast Core Pricing for Rich Advertising Auctions" is now accepted in Operations Research!
[Sep 2020] Conference versions of two of my recent working papers are now accepted:
(i) "Two-stage Stochastic Matching with Application to Ride Hailing" is accepted in SODA 2021!
(ii) "Stateful Posted Pricing with Vanishing Regret via Deterministic MDPs" is accepted in NeurIPS 2020!
[Aug 2020] New working paper "Batching and Optimal Multi-stage Bipartite Allocations" is out!
[July 2020] I am now an assistant professor at Chicago Booth!
[June 2020] New working paper: “Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes”
[Feb 2020] Three new working papers:
(i) "Two-stage Matching and Pricing with Applications to Ride Hailing"
(ii) "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization"
(iii) "Sequential Submodular Maximization and Applications to Ranking an Assortment of Products"
[Dec 2019] New working paper "Linear Programming Based Online Policies for Real-time Assortment of Reusable Resources" is out!
[Nov 2019] New working paper "Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection" is out!