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.

2020 (remote)

• “Multi-scale Online Learning: Theory and Applications”, MIT Sloan School of Management, May 2020.

• “Optimal Algorithms for Continuous Submodular Maximization”, Rutgers University CS, April 2020.

2019

• “Optimal Algorithms for Continuous Submodular Maximization”, University of Washington CS, Oct 2019.

• “Hierarchical Clustering with Structural Constraints”, Toyota Technological Institute at Chicago (TTIC), Sept 2019.

• “Optimal Algorithms for Continuous Submodular Maximization”, Google Research NYC, March 2019.

• Markets with Data: Challenges and Solutions", University of California Irvine CS, February 2019.

• Markets with Data: Challenges and Solutions", Purdue CS, February 2019.

• Markets with Data: Challenges and Solutions", Purdue ECE and IE, February 2019.

• “Data, Markets, and Structured Online Learning”, University of Chicago Booth School of Business, February 2019.

• “Data, Markets, and Structured Online Learning”, Purdue Krannert School of Management , February 2019.

• “Markets with Data: Challenges and Solutions”, Northwestern CS, February 2019.

• “Algorithms vs. Mechanisms: Bayesian Blackbox Reductions in Mechanism Design”, Northwestern Kellogg School of Business (MEDS), January 2019.

• “Data, Markets, and Structured Online Learning”, NYU Stern School of Business, January 2019.

• “Data, Markets, and Structured Online Learning”, University of Minnesota ISyE, January 2019.

• “Data, Markets, and Structured Online Learning”, University of Michigan's Ross School of Business, January 2019.

• “Data, Markets, and Structured Online Learning”, University of Illinois at Chicago IDS, January 2019.

2018

• “Optimal Algorithms for Continuous Submodular Maximization”, Georgia Tech ISyE DOS seminar, November 2018.

• “Optimal Algorithms for Continuous Submodular Maximization”, MIT EECS ML seminar, November 2018.

• “Optimal Algorithms for Continuous Submodular Maximization”, USC CS theory seminar, November 2018.

• “Optimal Algorithms for Continuous Submodular Maximization”, Northwestern EECS, 2018 Junior Theorists Workshop, November 2018

• “Optimal Algorithms for Continuous Submodular and DR-Submodular Maximization”, Yale YINS theory seminar, October 2018.

• “Multi-scale Online Learning and its Applications to Online Auctions”, Stanford TOCA-SV, January 2018.

2017

• “Bayesian Blackbox Reductions and Combinatorial Bernoulli Factories”, Stanford Theory Seminar, September 2017.

• “Bernoulli Factories and Blackbox Reductions in Mechanism Design”, Google Research Labs (NYC), July 2017.

• “Mechanism Design For Complex Environments: Online Auctions and Learning”, B-exam talk, Cornell University, June 2017.

• “Algorithms vs. Mechanisms : Mechanism Design For Complex Environments”, University at Buffalo, March 2017.

• “Bernoulli Factories and Mechanism Design”, Theory Seminar at Cornell University, Feb 2017.

2016

• “Online Leaning in Auctions”, Microsoft Research (Redmond), Aug 2016.

• “Secretary Problems with Non-Uniform Arrival Order”, University of Washington, July 2016.

• “Robustness and Approximation Theory in Online Algorithm Design”, INFORMS International 2016, June 2016.

• “Bernoulli Factories and Mechanism Design”, Microsoft Research (Redmond), May 2016.

• “Optimal Auctions vs. Anonymous Pricing” , NYCE 2016: New York Computer Science and Economics Day, January 2016.

2015

• “Robustness of Online Algorithms”, Google Research Labs (Mountain-view), Nov 2015.

• “Posted Pricing vs Optimal Auction in Single Item Environment”, Microsoft Research (New England), May 2015.