[J] Published, Accepted & Under-revision Journal Papers
[J23] “Dynamic Matching with Post-allocation Service and its Application to Refugee Resettlement”, major revision at Management Science (MS). [SSRN]
- With Kirk Bansak, Soonbong Lee, Vahideh Manshadi, and Elisabeth Paulson.
- The conference version appeared in ACM Conference on Economics & Computations (EC), 2024
- INFORMS AMD Section 2024 Rothkopf Junior Researcher Paper Prize (First Place; Entrant: Soonbong Lee)
- MSOM Best Student Paper Award (First Place; Entrant: Soonbong Lee)
- Covered by Yale Insight.
[J22] “Markovian Search with Socially Aware Constraints”, major revision at Management Science (MS). [SSRN]
- With Mohammad Reza Aminian and Vahideh Manshadi.
- INFORMS Service Science Best Student Paper Award (third place)
- Covered by Chicago Booth Review.
[J21] “Online Matching with Cancellation Costs”, major revision at Operations Research (OR). [arXiv] [SSRN]
- With Farbod Ekbatani and Yiding Feng.
- The conference version appeared in ACM Conference on Economics & Computations (EC), 2023
[J20] “Robustness of Online Inventory Balance Algorithm to Inventory Shocks”, major revision at Operations Research (OR). [SSRN]
- With Yiding Feng and Amin Saberi.
[J19] “Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection”, major revision at Mathematics of Operations Research (MOR). [SSRN]
- With Nima Anari, Amin Saberi and Ali Shameli
- An earlier version appeared in ACM Conference on Economics & Computations (EC), 2019
[J18] “Near-optimal Bayesian Online Assortment of Reusable Resources”, forthcoming in Operations Research (OR), 2024. [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]
[J17] “Batching and Optimal Multi-stage Bipartite Allocations”, forthcoming in Management Science (MS), 2024. [SSRN]
- With Yiding Feng.
- INFORMS AMD 2023 Rothkopf Junior Researcher Paper Prize (Second place; Entrant: 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]
[J16] “Bernoulli Factories for Flow-Based Polytopes”, SIAM Journal on Discrete Mathematics (SIDMA), 2023 [arXiv]
- With Jon Schneider and Renato Paes Leme.
[J15] “Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization”, Management Science (MS), 2023 [SSRN]
- With Ozan Candogan and Chen Chen.
- The conference version appeared in ACM Conference on Economics & Computations (EC), 2023
- Presented as a spotlight talk at INFORMS RM&P Conference, 2021
[J14] “Online Bipartite Matching with Reusable Resources”, Mathematics of Operations Research (MOR), 2023. [arXiv] [SSRN]
- With Steven Delong, Alireza Farhadi, Balu Sivan and Rajan Udwani.
- The conference version appeared in ACM Conference on Economics & Computations (EC), 2022
[J13] “Fair Dynamic Rationing”, Management Science (MS), 2023. [Link] [SSRN] [arXiv]
- With Vahideh Manshadi and Scott Rodilitz.
- INFORMS AMD 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, Yale Insights, and UCLA Anderson Review.
[J12] “Two-stage Matching and Pricing with Applications to Ride Hailing”, Operations Research (OR), 2023. [Link] [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
[J11] “Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes”, Mathematics of Operations Research (MOR), 2023. [arXiv]
- With Yuval Emek, Ron Lavi and Yangguang Shi.
- An earlier version appeared in Conference on Neural Information Processing Systems (NeurIPS), 2020
[J10] “Combinatorial Bernoulli Factories: Matchings, Flows, and Other Polytopes”, Bernoulli Journal, 2023. [SSRN] [arXiv]
- With Renato Paes Leme and Jon Schneider.
- An earlier version appeared in ACM Symposium on Theory of Computing (STOC), 2021
[J9] “Sequential Submodular Maximization and Applications to Ranking an Assortment of Products”, Operations Research (OR), 2022. [Link] [SSRN]
- With Arash Asadpour, Amin Saberi and Ali Shameli.
- An earlier version appeared in ACM Conference on Economics & Computations (EC), 2022
- Accepted for presentation at MSOM Conference, 2022
[J8] “Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization”, Management Science (MS), 2022. [Link][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
[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
- Covered by Chicago Booth Review.
[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] Working Papers with Preprints
[R7] "Online Combinatorial Optimization with Group Fairness Constraints", under preparation. [SSRN]
- With Negin Golrezaei, Kumar Kshitij Patel, and Fransisca Susan
- The conference version accepted in International Joint Conference on Artificial Intelligence (IJCAI), 2024
- Distinguished Paper Award (best paper) at IJCAI 2024
[R6] “Prophet Inequalities with Cancellation Costs”, under preparation. [arXiv] [SSRN]
- With Farbod Ekbatani, Pranav Nuti, and Jan Vondrak.
- The conference version accepted in ACM Symposium on Theory of Computing (STOC), 2024
[R5] “Robust Dynamic Staffing with Predictions”, under revision. [SSRN]
- With Yiding Feng and Vahideh Manshadi.
- Accepted for presentation in MSOM SIG Supply Chain Management, 2024
[R4] “Online Job Assignment”, under revision. [SSRN]
- With Farbod Ekbatani, Yiding Feng, and Ian Kash.
- Accepted for presentation in MSOM SIG Service, 2024
[R3] “Misalignment, Learning, and Ranking: Harnessing Users Limited Attention”, under revision. [SSRN]
- With Arpit Agarwal and Prathamesh Patil.
[R2] “Secretary Problems with Non-Uniform Arrival Order”, under preparation for submission. [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 for submission. [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 (pre-prints available upon request)
[W2] “The Magician Problem with Returning Boxes: Near-optimal Algorithm and Application to Bayesian Task Assignment” (pre-print available soon)
- With Mohammad Reza Aminian
[W1] “Ranking, Routing, and Learning in Online Food Delivery”, under preparation, with Rene Caldentey, Ozan Candogan, and Niusha Navidi.
[C] Peer-reviewed Conference Publications
[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].