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.

[W] Working Papers

[W7] “Two-stage Matching and Pricing with Applications to Ride Hailing”,
with Yiding Feng and Amin Saberi.
[SSRN]

[W6] “Online Learning via Offline Greedy : Applications in Market Design and Optimization”,
with Negin Golrezaei, Joshua Wang, Fransisca Susan and Ashwinkumar Badanidiyuru.
[SSRN]

[W5] “Ranking an Assortment of Products via Sequential Submodular Optimization”,
with Arash Asadpour, Amin Saberi and Ali Shameli.
[SSRN]

[W4] “Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes”,
with Yuval Emek, Ron Lavi, and Yangguang Shi.
[arXiv]

[W3] “Combinatorial Bernoulli Factories”.
with Renato Paes Leme and Jon Schneider.

[W2] “Linear Programming Based Online Policies for Real-time Assortment of Reusable Resources”,
with Yiding Feng and Amin Saberi.
[SSRN]

[W1] “Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection”,
with Nima Anari, Amin Saberi and Ali Shameli,
(preliminary conference version in EC’19).
[SSRN]

[J] Journal Papers


[J7] “Fast Core Pricing for Rich Advertising Auctions”,
with Jason Hartline, Mohammad Reza Khani, Nicole Immorlica, and Brendan Lucier,
minor revision from Operations Research (OR),
(preliminary conference version in ACM EC’18).
[arXiv]

[J6] “Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization”,
with Tim Roughgarden and Joshua Wang,
accepted in the Journal of Machine Learning Research (JMLR),
(preliminary conference version in NeurIPS’18).
(selected as top 30 papers for full oral presentation at NIPS, out of 4.8k+ submitted papers),
[arXiv]

[J5] “Bernoulli Factories and Black-Box Reductions in Mechanism Design”,
with Shaddin Dughmi, Jason Hartline and Bobby Kleinberg,
minor revision from the Journal of the ACM (JACM),
(preliminary conference version in ACM STOC’17, more recent version will appear in GAMES 2021)
(selected for presentation in Highlights Beyond EC 2020 Plenary Session .
[arXiv]

[J4] “Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing”,
with Sébastien Bubeck, Nikhil Devanur and Zhiyi Huang,
Journal of Machine Learning Research (JMLR),
(preliminary conference version in ACM EC’17).
[arXiv][link]

[J3] “Optimal Auctions vs. Anonymous Pricing”,
with Saeed Alaei, Jason Hartline, Yang Yuan, and Manolis Pountourakis,
Games and Economic Behavior (GEB),
(preliminary conference version in IEEE FOCS’15),
(selected as best algorithmic game theory papers from STOC/FOCS/SODA 2014-15).
[arXiv][link]

[J2] “On The Achievability of Cramer-Rao Bound in Noisy Compressed Sensing”,
with Massoud Babaie-Zadeh and Christian Jutten,
IEEE Transactions on Signal Processing, Volume 60, Issue 1,
[arXiv] [link].

[J1] “ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization”,
with Massoud Babaie-Zadeh, Sina Hamidi Ghalehjegh and Christian Jutten,
Elsevier Journal of Signal Processing, Volume 92, Issue 8,
[arXiv] [link].

[C] Peer Reviewed Conference Proceedings


[C21]“Persuasion and Incentives Through the Lens of Duality”,
with Shaddin Dughmi, Alex Psomas, and Matt Weinberg,
to appear in Proc. The 15th Conference on Web and Internet Economics (WINE 2019),
[arXiv][link]

[C20] “Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection”,
with Nima Anari, Amin Saberi and Ali Shameli,
in Proc. 20th ACM conference on Economics and Computation (EC 2019),
[arXiv][link]

[C19] “Hierarchical Clustering for Euclidean Data”,
with Vaggos Chatziafratis, Moses Charikar and Grigory Yaroslavtsev,
in Proc. 22nd International Conference on Artificial Intelligence and Statistics (AISTATS 2019),
[arXiv][link]

[C18] “Hierarchical Clustering better than Average-Linkage”,
with Vaggos Chatziafratis and Moses Charikar,
in Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA 2019),
[arXiv][link]

[C17] “Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization”,
with Tim Roughgarden and Joshua Wang,
in Proc. 32nd Conference on Neural Information Processing Systems (NeurIPS 2018)
[arXiv][link]

[C16] “Hierarchical Clustering with Structural Constraints”,
with Vaggos Chatziafratis and Moses Charikar,
in Proc. 35th International Conference on Machine Learning (ICML 2018),
[arXiv][link].

[C15] “Fast Core Pricing for Rich Advertising Auctions”,
with Jason Hartline, Mohammad Reza Khani, Nicole Immorlica, and Brendan Lucier,
in Proc. 19th ACM conference on Economics and Computation (EC 2018),
[arXiv][link].

[C14] “Prophet Inequalities vs. Approximating Optimum Online”,
with Amin Saberi and Ali Shameli,
in Proc. 14th Conference on Web and Internet Economics (WINE 2018).

[C13] “Bernoulli Factories and Black-Box Reductions in Mechanism Design”,
with Shaddin Dughmi, Jason Hartline and Bobby Kleinberg,
in Proc. 49th ACM Symposium on Theory of Computing (STOC 2017),
[arXiv][link].

[C12] “Online Auctions and Multi-scale Online Learning”,
with Sébastien Bubeck, Nikhil Devanur and Zhiyi Huang,
in Proc. 18th ACM conference on Economics and Computation (EC 2017),
[arXiv] [link].

[C11] “Truth and Regret in Online Scheduling”,
with Nikhil Devanur, Shuchi Chawla, and Janardhan Kulkarni,
in Proc. 18th ACM conference on Economics and Computation (EC 2017),
[arXiv] [link].

[C10] “GSP - The Cinderella of Mechanism Design”,
with Chris Wilkens and Ruggiero Cavallo,
in Proc. 26th International World Wide Web Conference (WWW 2017),
[arXiv] [link].

[C9] “Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions”,
with Chris Wilkens,
in Proc. 12th Conference on Web and Internet Economics (WINE 2016),
[arXiv] [link].

[C8] “Optimal Auctions vs. Anonymous Pricing”,
with Saeed Alaei, Jason Hartline, Yang Yuan, and Manolis Pountourakis,
conference version appeared in Proc. 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015),
also presented at 5th World Congress of the Game Theory Society (GAMES 2016),
[arXiv] [link].

[C7] “Secretary Problems with Non-Uniform Arrival Order”,
with Thomas Kesselheim and Bobby Kleinberg,
in Proc. 47th ACM Symposium on Theory of Computing (STOC 2015),
also presented at 1st Highlights of Algorithms (HALG 2016),
[arXiv] [link].

[C6] “Simple and Near-Optimal Mechanisms For Market Intermediation”,
with Yang Yuan and Bobby Kleinberg,
in Proc. 10th Conference on Web and Internet Economics (WINE 2014),
[arXiv] [link].

[C5] “A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting”,
with Bobby Kleinberg,
Technical Report (course material for CS 6820 at Cornell),
[arXiv].

[C4] “Mechanism Design for Value Maximizers”,
with Chris Wilkens, Ruggiero Cavallo, and Samuel Taggart,
Technical Report,
[arXiv].

[C3] “An Alternating Minimization Algorithm for Sparse Channel Estimation”,
with Massoud Babaie-Zadeh and Christian Jutten,
in Proc. of 9th International Conference on Latent Variable Analysis and Signal Separation (LVA-ICA 2010),
[arXiv] [link].

[C2] “Adaptive and Non-Adaptive ISI Sparse Channel Estimation Based on SL0 and Its Application in ML Sequence-by-Sequence Equalization”,
with Masoud Babaie-Zadeh, Sina Hamidi Ghalehjegh and Christian Jutten,
in Proc. of 9th International Conference on Latent Variable Analysis and Signal Separation (LVA-ICA 2010),
[arXiv] [link].

[C1] “Implementation and Optimization of Wavelet Modulation in Additive Gaussian Channels”,
with Sahar Nassirpour and Mohammad B. Shamsollahi,
in Proc. 11th International Conference on Advanced Communication Technology (ICACT 2009),
[arXiv] [link].

[S] Surveys, Magazines and Theses

[S3] a survey on “Bayesian Black-Box Reductions in Mechanism Design”,
with Shaddin Dughmi, Jason Hartline and Bobby Kleinberg,
in ACM SIGecom Exchanges letters, Vol. 16.1,

[abstract] In this letter, we report on our work providing a polynomial time reduction from Bayesian incentive compatible mechanism design to Bayesian algorithm design for welfare maximization problems. Unlike prior results, our reduction achieves exact incentive compatibility for problems with multidimensional and continuous type spaces.
[link]

[S2] “Algorithms Versus Mechanisms: How to Cope with Strategic Input?”,
in XRDS: Crossroads, The ACM Magazine for Students, Vol. 24 Issue 1, Fall 2017,
[abstract] Online markets and platforms rely on human user decisions as inputs. This generates the challenge of managing user incentives and misbehaviors as strategic entities. Surprisingly, one can show that designers do not require much additional computational power to overcome this challenge
[link]

[S1] “Algorithms Vs. Mechanisms: Mechanism Design for Complex Environments”­,
PhD Thesis (under Professor Robert Kleinberg), Cornell University, Summer 2017,
[link].

Professional Services

  • Program Committee:

    • ACM Conference on Economics and Computation (EC),

    • The Conference on Web and Internet Economics (WINE),

    • European Symposium on Algorithms (ESA).

  • Reviewer:

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

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

    • Econ and CS/EE Journals: Games and Economic Behavior, Transactions on Economics and Computation (TEAC), SIAM Journal on Computing (SICOMP), Journal of the ACM (JACM), IEEE Transactions on Signal Processing, IEEE Transactions on Communications, and IEEE Transactions on Information Theory.