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 cs.stanford.edu.

Short Intro

I am a “Motwani postdoctoral researcher” at Stanford University (computer science department, theory group). Prior to Stanford, I finished my Ph.D. in theoretical computer science at Cornell University, where I was thrilled to have professor Robert Kleinberg as my advisor. I received my B.Sc. and M.Sc. degrees in electrical engineering form Sharif University of Technology in 2008 and 2010 respectively.

Research Interests

My research lies are in different areas of theoretical computer science and operations research, with a focus on “economics and computation”:

  • Algorithmic mechanism design,

  • Online algorithms and mechanisms,

  • Learning in mechanisms and markets,

  • Computational social choice.

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

  • On a separate note: my better half, Saba Niaki, is a graphic designer and is looking for jobs in the Bay Area. Check her well-designed homepage!

What’s new?

  • Check my 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].

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

  • I’m giving a talk on “Bernoulli Factories and Black-Box Reductions in Mechanism Design” at Stanford CS Theory Seminar on October 4, 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!

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

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

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

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

  • I’m invited to write an article on strategic input to algorithms for XRDS: Crossroads, The ACM Magazine for Students!

  • We are invited to contribute a letter for SIGEcom exchanges on our STOC’17 paper about Bayesian black-box reductions!

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

  • I’ll give a talk on “Bernoulli Factories and Black-Box Reductions in Mechanism Design” at Google Research (NYC) on July 18, 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!

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

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

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

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

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

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

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

  • My 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!

Honor and Awards

Research Internships

During several internships, I had the great privilege of being mentored by: