alt text 

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

Motwani Postdoctoral Researcher,
Department of Computer Science,
Stanford University,
Address: Gates 484, 353 Serra Mall, Stanford, CA 94305.
Email: rad at

Selected Invited Talks

  • “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.

  • “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.

  • “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.

  • “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.