Skip to main content

Publications (by date)

[J] Published & Accepted Journal Papers 

[J12] “Sequential Submodular Maximization and Applications to Ranking an Assortment of Productsforthcoming in Operations Research (OR), 2022[SSRN]

  • With Arash Asadpour, Amin Saberi and Ali Shameli.
  • The conference version accepted in ACM Conference on Economics & Computations (EC), 2022
  • Accepted for presentation at MSOM Conference, 2022

[J11] “Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization”forthcoming in Management Science (MS), 2022[SSRN] [arXiv]

  • With Negin Golrezaei, Joshua Wang, Fransisca Susan and Ashwinkumar Badanidiyuru.
  • An earlier version appeared in ACM Conference on Economics & Computations (EC), 2021
  • Finalist for the 2021 INFORMS Data Mining Section Best Paper
  • Accepted for presentation at MSOM Conference, 2022

[J10] “Fair Dynamic Rationing”forthcoming in Management Science (MS), 2022[SSRN] [arXiv]

  • With Vahideh Manshadi and Scott Rodilitz.
  • INFORMS AMD Section 2021 Rothkopf Junior Researcher Paper Prize (First place)
  • An earlier version appeared in ACM Conference on Economics & Computations (EC), 2021
  • Presented as a spotlight talk at INFORMS RM&P Conference, 2021
  • Accepted for presentation at MSOM Service SIG, 2022
  • Covered by Chicago Booth Review and Yale Insights.

[J9] “Two-stage Matching and Pricing with Applications to Ride Hailing”forthcoming in Operations Research (OR), 2022. [SSRN]

  • With Yiding Feng and Amin Saberi.
  • An earlier version appeared in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021
  • Presented as a spotlight talk at INFORMS RM&P Conference 2021

[J8] “Combinatorial Bernoulli Factories: Matchings, Flows, and Other Polytopes”forthcoming in Bernoulli Journal, 2022. [SSRN] [arXiv]

  • With Renato Paes Leme and Jon Schneider.
  • An earlier version appeared in ACM Symposium on Theory of Computing (STOC), 2021

[J7] “Fast Core Pricing for Rich Advertising Auctions”Operations Research (OR), 2021. [Link] [SSRN]

  • With Jason Hartline, Mohammad Reza Khani, Nicole Immorlica, and Brendan Lucier.
  • An earlier version appeared in ACM Conference on Economics & Computations (EC), 2018

[J6] “Bernoulli Factories and Black-Box Reductions in Mechanism Design”Journal of the ACM (JACM), 2021. [Link] [arXiv]

  • With Shaddin Dughmi, Jason Hartline and Bobby Kleinberg.
  • An earlier version appeared in ACM Symposium on Theory of Computing (STOC), 2017
  • Presented as at GAMES 2021
  • Selected for a plenary presentation in Highlights Beyond EC 2020 Plenary Session

[J5] “Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization”, Journal of Machine Learning Research (JMLR), 2020. [Link] [arXiv]

  • With Tim Roughgarden and Joshua Wang.
  • An earlier version appeared in Conference on Neural Information Processing Systems (NuerIPS), 2018
  • Selected as top 30 papers for full oral presentation at NeurIPS, out of 4.8k+ submitted papers

[J4] “Multi-scale Online Learning: Theory and Applications to Online Auctions and Pricing”, Journal of Machine Learning Research (JMLR), 2020. [Link] [arXiv]

  • With Sébastien Bubeck, Nikhil Devanur and Zhiyi Huang.
  • An earlier version appeared in ACM Conference on Economics & Computations (EC), 2017

[J3] “Optimal Auctions vs. Anonymous Pricing”Games and Economic Behavior (GEB), 2018. [Link] [arXiv]

  • With Saeed Alaei, Jason Hartline, Yang Yuan, and Manolis Pountourakis,
  • An earlier version appeared in IEEE Foundations of Computer Science (FOCS), 2015
  • Selected as one of the best algorithmic game theory papers from STOC/FOCS/SODA 2014-15.

[J2] “On The Achievability of Cramer-Rao Bound in Noisy Compressed Sensing”IEEE Transactions on Signal Processing, 2011. [Link] [arXiv]

  • With Massoud Babaie-Zadeh and Christian Jutten.

[J1] “ISI sparse channel estimation based on SL0 and its application in ML sequence-by-sequence equalization”Elsevier Journal of Signal Processing, 2011. [Link] [arXiv]

  • With Massoud Babaie-Zadeh, Sina Hamidi Ghalehjegh and Christian Jutten.

[R] Preprints & Papers under Review

[R11] “Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual”, to be submitted soon. [arXiv] [SSRN]

  • with Farbod Ekbatani and Yiding Feng.

[R10] “Near-optimal Bayesian Online Assortment of Reusable Resources”, major revision at Operations Research (OR). [SSRN]

  • With Yiding Feng and Amin Saberi.
  • The conference version accepted in ACM Conference on Economics & Computations (EC), 2022
  • An earlier online version of this paper was titled as "Linear Programming Based Online Policies for Real-time Assortment of Reusable Resources". [SSRN]

[R9] “Batching and Optimal Multi-stage Bipartite Allocations”, revise & resubmit at Management Science (MS)[SSRN]

  • With Yiding Feng.
  • An earlier version appeared in Innovations in Theoretical Computer Science (ITCS), 2021
  • Follow-up work on "Optimal Multi-stage Configuration Allocation with Applications to Video Advertising". [SSRN]

[R8] “Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization”, major revision at Management Science (MS). [SSRN]

  • With Ozan Candogan and Chen Chen.
  • Presented as a spotlight talk at INFORMS RM&P Conference, 2021

[R7] “Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes”major revision at Mathematics of Operations Research (MOR). [arXiv]

  • With Yuval Emek, Ron Lavi and Yangguang Shi.
  • An earlier version appeared in Conference on Neural Information Processing Systems (NeurIPS), 2020

[R6] Online Assortment of Reusable Resources with Exogenous Replenishmentto be submitted soon. [SSRN]

  • With Yiding Feng and Amin Saberi.

[R5]Online Bipartite Matching with Reusable Resourcesunder revision in Mathematics of Operations Research (MOR). [arXiv] [SSRN]

  • With Steven Delong, Alireza Farhadi, Balu Sivan and Rajan Udwani. 
  • An earlier version appeared in ACM Conference on Economics & Computations (EC), 2022

[R4] Descending Price Auctions with Bounded Number of Prices Levels and Batched Prophet Inequalityunder preparation. [SSRN] [arXiv]

  • With Saeed Alaei, Ali Makhdoumi, and Azarakhsh Malekian.
  • The conference version accepted in ACM Conference on Economics & Computations (EC), 2022
  • Accepted for presentation at Marketplace Innovation Workshop, 2022

[R3] “Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection”, to be submitted soon[SSRN]

  • With Nima Anari, Amin Saberi and Ali Shameli
  • An earlier version appeared in ACM Conference on Economics & Computations (EC), 2019

[R2] “Secretary Problems with Non-Uniform Arrival Order”under preparation[arXiv]

  • With Thomas Kesselheim and Bobby Kleinberg.
  • An earlier version appeared in ACM Symposium on Theory of Computing (STOC), 2015. [ink]
  • Presented at 1st Highlights of Algorithms (HALG), 2016

[R1] “Truth and Regret in Online Scheduling”under preparation[arXiv]

  • With Nikhil Devanur, Shuchi Chawla, and Janardhan Kulkarni,
  • An earlier version appeared in ACM Conference on Economics & Computations (EC), 2017. [Link]

[W] Work in Progress 

[W5] “Bernoulli Factories for Flow-Based Polytopes”, under preparation, with Jon Schneider and Renato Paes Leme.

[W4] “Non-discriminatory Search and Online Allocation”under preparation, with Mohammad Reza Aminian and Vahideh Manshadi.

[W3] “Ranking, Routing, and Learning in Online Food Delivery”under preparation, with Rene Caldentey, Ozan Candogan, and Niusha Navidi.

[W2] “Data-driven Statistical Analysis in Ride Sharing”under preparation, with Lynn Xu and Amy Ward. 

[W1] "Constant Approximation for Maximizing Weak-DR Continuous Submodular Functions with Cardinality Constraint"under preparation, with Ashwinkumar Badanidiyuru and Joshua Wang. 

[C] Peer-reviewed 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. Those that have a journal version are excluded]  

[C12] “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]

[C11] “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]

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

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

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

[C7] “Mechanism Design for Value Maximizers”,
with Chris Wilkens, Ruggiero Cavallo, and Samuel Taggart,
An earlier version was titled as “GSP - The Cinderella of Mechanism Design” .
in Proc. 26th International World Wide Web Conference (WWW 2017),
[arXiv][link]

[C6] “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]

[C5] “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]

[C4] “A Unified Approach to Online Allocation Algorithms via Randomized Dual Fitting”,
with Bobby Kleinberg,
Technical Report (course material for CS 6820 at Cornell),
[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].