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.

About me

I am a postdoc at Stanford University (CS department, theory group), where I am fortunate to be mentored by Prof. Amin Saberi, Prof. Tim Roughgarden and Prof. Moses Charikar. Prior to Stanford, I obtained my Ph.D. in Computer Science (minored in Applied Mathematics) from Cornell University, where I was thrilled to be advised by Prof. Robert Kleinberg. During my Ph.D., I was awarded the Google Ph.D. Fellowship (market algorithms), Jacobs Scholar Fellowship (Cornell) and Motwani Fellowship (Stanford). I was also a research intern at Microsoft Research (Redmond), Microsoft Research (New England) and Yahoo! Research.

I am on the CS and OR academic job market this year!

Research Interests

I am broadly interested in algorithms, game theory and machine learning, with a focus on applications in market design and revenue management:

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

[Click here to see some of my research highlights]

Recent Publications (Click here for full chronological list)

1. “Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization’’ [arXiv],

with Tim Roughgarden and Joshua Wang,
in Proc. 32nd Conference on Neural Information Processing Systems (NIPS 2018),
under-review in the Journal of Machine Learning Research (JMLR).
(among top 30 selected papers for oral presentation out of 4.8k+ submitted papers).

2. “Multi-scale Online Learning and its Applications to Online Auctions” [arXiv] [link]

with Sébastien Bubeck, Nikhil Devanur and Zhiyi Huang,
revise & resubmit from the Journal of Machine Learning Research (JMLR), 2018,
preliminary conference version in Proc. 18th ACM conference on Economics and Computation (EC 2017).

3. “Optimal Auctions vs. Anonymous Pricing” [arXiv] [link]

with Saeed Alaei, Jason Hartline, Yang Yuan, and Manolis Pountourakis,
forthcoming in the special issue on selected papers from STOC/FOCS/SODA, Games and Economic Behavior (GEB), 2018,
preliminary conference version in Proc. 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015).

4. “Bernoulli Factories and Black-Box Reductions in Mechanism Design” [arXiv] [link]

with Shaddin Dughmi, Jason Hartline and Bobby Kleinberg,
preliminary conference version in Proc. 49th ACM Symposium on Theory of Computing (STOC 2017),
under-review in the Journal of the ACM (JACM), 2018.

5. “Fast Core Pricing for Rich Advertising Auctions” [arXiv] [link]

with Jason Hartline, Mohammad Reza Khani, Nicole Immorlica, and Brendan Lucier,
revise & resubmit from Operations Research (OR), 2018,
preliminary conference version in Proc. 19th ACM conference on Economics and Computation (EC 2018).

6. “Hierarchical Clustering with Structural Constraints” [arXiv] [link]

with Vaggos Chatziafratis and Moses Charikar,
in Proc. 35th International Conference on Machine Learning (ICML 2018).

What’s new?

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

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

  • Aug 2018: our paper [J1 , C6] got accepted to the special issue on selected papers from STOC/FOCS/SODA in GEB!

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

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

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

[Click here for more!]

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

Honor and Awards

Research Internships

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

Professional Services

  • Program Committee:

    • ACM Conference on Economics and Computation (EC).

  • Reviewer:

    • CS Conferences: EC, FOCS, STOC, SODA,WINE, and WWW.

    • OR Journals: Operations Research (OR), Management Science (MS), and Mathematics of Operations Research (Math of OR).

    • Econ and CS Journals: Transactions on Economics and Computation (TEAC), and SIAM Journal on Computing (SICOMP).