Publications

[W] Working Papers

[W11] “Near-optimal Experimental Design for Networks: Independent Block Randomization”,
with Ozan Candogan and Chen Chen.
(to be presented as a spotlight talk at RM&P conference 2021)
[SSRN]

[W10] “Online Assortment of Reusable Resources with Exogenous Replenishment”,
with Yiding Feng and Amin Saberi.
[SSRN]

[W9] “Fair Dynamic Rationing”,
with Vahideh Manshadi and Scott Rodilitz.
(preliminary conference version to appear in EC 2021)
(to be presented as a spotlight talk at RM&P conference 2021)
[SSRN]

[W8] “Combinatorial Bernoulli Factories: Matchings, Flows, and Other Polytopes”,
with Renato Paes Leme and Jon Schneider.
(preliminary conference version to appear in STOC 2021)
[SSRN]

[W7] “Near-optimal Bayesian Online Assortment of Reusable Resources”,
with Yiding Feng and Amin Saberi.
[SSRN]

[W6] “Batching and Optimal Multi-stage Bipartite Allocations”,
with Yiding Feng.
(preliminary conference version in ITCS 2021)
[SSRN]

[W5] “Two-stage Matching and Pricing with Applications to Ride Hailing”,
with Yiding Feng and Amin Saberi.
(preliminary conference version in SODA 2021)
(to be presented as a spotlight talk in RM&P conference 2021)
[SSRN]

[W4] “Sequential Submodular Maximization and Applications to Ranking an Assortment of Products,
with Arash Asadpour, Amin Saberi and Ali Shameli.
[SSRN]

[W3] “Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes”,
with Yuval Emek, Ron Lavi and Yangguang Shi.
(preliminary conference version in NeurIPS 2020)
[arXiv]

[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 Publications

[J8] “Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization”,
with Negin Golrezaei, Joshua Wang, Fransisca Susan and Ashwinkumar Badanidiyuru.
minor revision, Management Science (MS)
(preliminary conference version to appear in EC'21)
[SSRN]

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

[J6] “Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization”,
with Tim Roughgarden and Joshua Wang,
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][link]

[J5] “Bernoulli Factories and Black-Box Reductions in Mechanism Design”,
with Shaddin Dughmi, Jason Hartline and Bobby Kleinberg,
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] Conference Publications

[Note: computer science (theory) conferences (i) are peer reviewed with rebuttals, (ii) considered comparable to (or sometimes more prestigious than) journals in CS, and (iii) have alphabetical author orderings] 

[C27] "Fair Dynamic Rationing”,
with Vahideh Manshadi and Scott Rodilitz,
to appear in Proc. 22nd ACM Economics and Computation (EC 2021),
to be presented as a spotlight talk at Revenue Management & Pricing conference (RM&P 2021)

[SSRN]

[C26] Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization”,
with Negin Golrezaei, Joshua Wang, Fransisca Susan, and Ashwinkumar Badanidiyuru,
to appear in Proc. 22nd ACM Economics and Computation (EC 2021),
[SSRN][arXiv]

[C25] Combinatorial Bernoulli Factories: Matching, Flow, and Other Polytopes,
with Renato Paes Leme and Jon Schneider,
to appear in Proc. 53rd ACM Symposium on Theory of Computing (STOC 2021),
[SSRN][arXiv]

[C24] Batching and Optimal Multi-stage Bipartite Allocations,
with Yiding Feng,
in Proc. I12th nnovations in Theoretical Computer Science (ITCS 2021)
[SSRN]

[C23] “Two-stage Stochastic Matching with Application to Ride Hailing”,
with Yiding Feng and Amin Saberi,
in Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA 2021),
to be presented as a spotlight talk at Revenue Management & Pricing conference (RM&P 2021)

[SSRN]

[C22] “Stateful Posted Pricing with Vanishing Regret via Deterministic MDPs”,
with Yuval Emek, Ron Lavi, and Yangguang Shi,
in Proc. 34th Conference on Neural Information Processing Systems (NeurIPS 2020)
[arXiv]

[C21] “Persuasion and Incentives Through the Lens of Duality”,
with Shaddin Dughmi, Alex Psomas, and Matt Weinberg,
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),
[link]

[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,
[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,
[link]

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