alt text 

Rad Niazadeh (راد نیازاده)

Assistant Professor,
Operations Management Department,
The University of Chicago Booth School of Business,
Adress: 5807 S Woodlawn Ave, Chicago, IL 60637.
Email: rad.niazadeh at chicagobooth.edu.


I am an Assistant Professor of Operations Management at Chicago Booth School of Business. I study the interplay between algorithms, incentives, and learning in online marketplaces, with a focus on revenue management and market design. Some primary topics in my research include:

  • Algorithmic mechanism design and game theory,

  • Online learning theory and applications,

  • Online algorithms and applications,

  • Algorithmic aspects of machine learning in operations research,

I received my PhD in Computer Science (minored in Applied Mathematics) from Cornell University. I was thrilled to have Prof. Robert Kleinberg as my PhD advisor. Prior to joining Booth, I was a Visiting Faculty Researcher in the market algorithms group at Google Research NYC. I was also a Motwani Postdoctoral Fellow at Stanford University, Department of Computer Science.

Here are the links to my Google scholar page and my CV.

[Click Here for a List of Publications]

What’s new?

[Click here for more!]

  • Sep 2019: Our paper “Persuasion and Incentives Through the Lens of Duality” is accepted at WINE’19!

  • Apr 2019: Our paper “Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection” is accepted at ACM EC’19!

  • Dec 2018: Our paper “Hierarchical Clustering for Euclidean Data” is accepted at AISTATS’19!

  • Nov 2018: Our paper “Multi-scale Online Learning and its Applications to Online Auctions” got accepted in the Journal of Machine Learning Research (JMLR)!

  • Nov 2018: I won the INFORMS Revenue Management & Pricing Dissertation (Honorable Mention) Award!

  • Nov 2018: I'm invited to give a talk at 2018 Junior Theorists Workshop at Northwestern, Nov 15-16.

  • Sept 2018: our paper [C17] is accepted at SODA 2019!

  • Nov 2018: I will be giving the following talks at INFORMS Annual Meeting 2018:

    • Dynamic Pricing/auctions by Multi-scale Online Learning, TB53: Nov 6, 10:30 AM - 12:00 PM, North Bldg 232A

    • Fast Core Pricing for Rich Advertising Auctions, SA53: Nov 4, 8:00 AM - 9:30 AM, North Bldg 232A

    • Continuous Submodular Maximization and Applications, WC04: Nov 7, 1:30 PM - 3:00 PM, North Bldg 122A

  • Oct 2018: I am invited to give a talk at the DOS seminar at Georgia Tech ISyE, Nov 30.

  • Oct 2018: I am invited to give a talk at the Machine Learning seminar at MIT, Nov 28.

  • Oct 2018: I am invited to give a talk at the CS theory seminar at USC, Nov 27.

  • Oct 2018: I gave a talk at the YINS theory seminar at Yale , Oct 23.

  • Sept 2018: our paper [C16] is accepted for oral presentation at NIPS 2018!

  • Sept 2018: our paper \\[C13\\] is accepted at WINE 2018!

  • Aug 2018: our paper [J7] is accepted for publication in GEB (special issue on selected papers from STOC/FOCS/SODA)!

  • Apr 2018: I'm giving an invited talk at INFORMS Annual Meeting 2018 (Phoenix) on our paper [J1 , C3].

  • May 2018: I'm giving an invited talk at INFORMS Annual Meeting 2018 (Phoenix) (auction cluster) on our paper [J2 , C6].

  • May 2018: our paper [C2] got accepted to ICML 2018!

  • Apr 2018: our paper [C3] got accepted to EC 2018!

  • Apr 2018: I'm excited to organize (jointly with Nima Anari) a reading group on “Modern Algorithmic Toolboxes (Chapter 1: Sampling and Counting)” during the Spring quarter at Stanford! [link]

  • Apr 2018: I'm giving an invited talk at TRIPODS Southwest Summer Conference on May 22! [link].

  • Jan 2018: I'm giving a talk on “Auctions and Multi-scale Online Learning” at third TOCA-SV meeting at Stanford University on January 12, 2018!

  • Dec 2017: check my new article “Algorithms Versus Mechanisms: How to Cope with Strategic Input?” that appeared in the Fall’17 volume of the XRDS: Crossroads, The ACM Magazine for Students [link].

  • Nov 2017: check my survey article on black-box reductions in mechanism design, appeared in ACM SIGecom Exchanges letters, Vol. 16.1 [link].

  • Oct 2017: I’m giving three talks at INFORMS Annual Meeting 2017 (Houston) on October 25, 2017!

  • Sept 2017: I’m giving a talk on “Bernoulli Factories and Black-Box Reductions in Mechanism Design” at Stanford CS Theory Seminar on October 4, 2017!

  • Aug 2017: I’m excited to join Stanford CS Theory Group as a Motwani Postdoc starting in September 2017!

  • Aug 2017: I defended my Ph.D. dissertation, entitled “Mechanism Design for Complex Environments”, on June 16, 2017!

  • Aug 2017: I’m giving an invited talk on “Algorithms vs. Mechanisms for Bayesian Welfare Optimization” at SUNY Buffalo CSE 50th Anniversary on September 29, 2017!

  • July 2017: I’m excited to be a long-term visiting scientist at Simons Institute for the Theory of Computing during Fall 2017!

  • June 2017: I will visit Princeton theory group (hosted by Matt Weinberg) during July and August, 2017!

  • June 2017: I’ll give a talk on “Bernoulli Factories and Black-Box Reductions in Mechanism Design” at Google Research (NYC) on July 18, 2017!

  • May 2017: I’ll give a talk on “Black-Box Reductions in Mechanism Design” in New York Computer Science and Economics Day (NYCE) on May 19, 2017!

  • May 2017: our papers “Truth and Regret in Online Scheduling” and “Online Auctions and Multi-scale Learning” got accepted to EC 2017!

  • Apr 2017: I’ll give a colloquium talk on “Robustness of Online Algorithms” at SUNY Buffalo on April 20, 2017!

  • Feb 2017: my paper “Bernoulli Factories and Black-Box Reductions in Mechanism Design” got accepted to STOC 2017!

  • Feb 2017: our work “Truth and Regret in Online Scheduling” will also be presented at STOC 2017 poster session!

  • Feb 2017: I’ll give a talk on “Algorithms vs. Mechanisms : Mechanism Design For Complex Environments” at SUNY Buffalo on March 30, 2017!

  • Feb 2017: my paper “GSP - The Cinderella of Mechanism Design” got accepted to WWW 2017!

  • Jan 2017: I’ll give a talk on “Algorithms vs. Mechanisms : Mechanism Design For Complex Environments” at Cornell University on February 7, 2017!

  • Jan 2017: our paper “Optimal Auctions vs Anonymous Pricing“ is invited to Games and Economic Behavior (GEB): Special Issue for best AGT papers from STOC, FOCS, and SODA 2014-2015!