Improving Optimization-Based Approximate Inference by Clamping Variables. - Junyao Zhao 001; Josip Djolonga; Sebastian Tschiatschek; Andreas Krause 001 (UAI, 2017)

Robust Maximization of Non-Submodular Objectives. - Ilija Bogunovic; Junyao Zhao 001; Volkan Cevher (AISTATS, 2018)

Cardinality constrained submodular maximization for random streams. - Paul Liu 001; Aviad Rubinstein; Jan Vondrák; Junyao Zhao 001 (NeurIPS, 2021)

Exponential communication separations between notions of selfishness. - Aviad Rubinstein; Raghuvansh R. Saxena; Clayton Thomas; S. Matthew Weinberg; Junyao Zhao 001 (STOC, 2021)

The randomized communication complexity of randomized auctions. - Aviad Rubinstein; Junyao Zhao 001 (STOC, 2021)

The randomized communication complexity of revenue maximization. - Aviad Rubinstein; Junyao Zhao 001 (SIGecom Exch., 2021)

Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation. - Aviad Rubinstein; Junyao Zhao 001 (ICALP, 2022)

Budget-Smoothed Analysis for Submodular Maximization. - Aviad Rubinstein; Junyao Zhao 001 (ITCS, 2022)

Beyond Worst-Case Budget-Feasible Mechanism Design. - Aviad Rubinstein; Junyao Zhao 001 (ITCS, 2023)

Multi-Channel Auction Design in the Autobidding World. - Gagan Aggarwal; Andrés Perlroth; Junyao Zhao 001 (EC, 2023)

The Power of Menus in Contract Design. - Guru Guruganesh; Jon Schneider; Joshua R. Wang; Junyao Zhao 001 (EC, 2023)

Strategizing against No-Regret Learners in First-Price Auctions. - Aviad Rubinstein; Junyao Zhao 001 (EC, 2024)

Universal Online Contention Resolution with Preselected Order. - Junyao Zhao 001 (ICALP, 2025)