Tight approximation ratio of anonymous pricing. - Yaonan Jin; Pinyan Lu; Qi Qi 003; Zhihao Gavin Tang; Tao Xiao (STOC, 2019)

On the Approximability of Simple Mechanisms for MHR Distributions. - Yaonan Jin; Weian Li; Qi Qi 003 (WINE, 2019)

Tight revenue gaps among simple and optimal mechanisms. - Yaonan Jin; Pinyan Lu; Qi Qi 003; Zhihao Gavin Tang; Tao Xiao (SIGecom Exch., 2019)

A robust multi-dimensional sparse Fourier transform in the continuous setting. - Yaonan Jin; Daogao Liu; Zhao Song 002 (CoRR, 2020)

Tight Revenue Gaps Among Simple Mechanisms. - Yaonan Jin; Pinyan Lu; Zhihao Gavin Tang; Tao Xiao (SIAM J. Comput., 2020)

Optimal Budget-Feasible Mechanisms for Additive Valuations. - Nick Gravin; Yaonan Jin; Pinyan Lu; Chenhao Zhang 003 (ACM Trans. Economics and Comput., 2020)

Tight Revenue Gaps among Multi-Unit Mechanisms. - Yaonan Jin; Shunhua Jiang; Pinyan Lu; Hengjie Zhang (EC, 2021)

Fourier growth of structured $ mathbb{F}_2$-polynomials and applications. - Jaroslaw Blasiok; Peter Ivanov; Yaonan Jin; Chin Ho Lee; Rocco A. Servedio; Emanuele Viola (CoRR, 2021)

Fourier growth of structured 𝔽2-polynomials and applications. - Jaroslaw Blasiok; Peter Ivanov; Yaonan Jin; Chin Ho Lee; Rocco A. Servedio; Emanuele Viola (Electron. Colloquium Comput. Complex., 2021)

First Price Auction is 1 - 1 /e2 Efficient. - Yaonan Jin; Pinyan Lu (FOCS, 2022)

Average-Case Subset Balancing Problems. - Xi Chen 001; Yaonan Jin; Tim Randolph 001; Rocco A. Servedio (SODA, 2022)

Tight Revenue Gaps among Multiunit Mechanisms. - Yaonan Jin; Shunhua Jiang; Pinyan Lu; Hengjie Zhang (SIAM J. Comput., 2022)

Settling the Efficiency of the First-Price Auction. - Yaonan Jin; Pinyan Lu (SIGecom Exch., 2022)

Subset Sum in Time 2n/2 / poly(n). - Xi Chen 001; Yaonan Jin; Tim Randolph 001; Rocco A. Servedio (APPROX/RANDOM, 2023)

Learning Reserve Prices in Second-Price Auctions. - Yaonan Jin; Pinyan Lu; Tao Xiao (ITCS, 2023)

Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity. - Yaonan Jin; Daogao Liu; Zhao Song 002 (SODA, 2023)

The Price of Stability for First Price Auction. - Yaonan Jin; Pinyan Lu (SODA, 2023)

Bayesian Auction Design and Approximation - Yaonan Jin (2023)

First Price Auction is 1-1/e2 Efficient. - Yaonan Jin; Pinyan Lu (J. ACM, 2023)

Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer. - Yaonan Jin; Pinyan Lu (FOCS, 2024)

Beyond Regularity: Simple versus Optimal Mechanisms, Revisited. - Yiding Feng 001; Yaonan Jin (CoRR, 2024)

Local Search for Clustering in Almost-linear Time. - Shaofeng H.-C. Jiang; Yaonan Jin; Jianing Lou; Pinyan Lu (CoRR, 2025)

Tight Regret Bounds for Fixed-Price Bilateral Trade. - Houshuang Chen; Yaonan Jin; Pinyan Lu; Chihao Zhang 001 (CoRR, 2025)

Fully Dynamic Euclidean k-Means. - Sayan Bhattacharya; Martín Costa; Ermiya Farokhnejad; Shaofeng H.-C. Jiang; Yaonan Jin; Jianing Lou (CoRR, 2025)

Competition Erases Simplicity: Tight Regret Bounds for Uniform Pricing with Multiple Buyers. - Houshuang Chen; Yaonan Jin; Pinyan Lu; Chihao Zhang 001 (CoRR, 2025)