Yaonan Jin

According to our database, Yaonan Jin authored at least 25 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Competition Erases Simplicity: Tight Regret Bounds for Uniform Pricing with Multiple Buyers.

Houshuang Chen, Yaonan Jin, Pinyan Lu, Chihao Zhang

CoRR, July, 2025

Fully Dynamic Euclidean k-Means.

Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad, Shaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou

CoRR, July, 2025

Tight Regret Bounds for Fixed-Price Bilateral Trade.

Houshuang Chen, Yaonan Jin, Pinyan Lu, Chihao Zhang

CoRR, April, 2025

Local Search for Clustering in Almost-linear Time.

Shaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou, Pinyan Lu

CoRR, April, 2025

2024

Beyond Regularity: Simple versus Optimal Mechanisms, Revisited.

Yiding Feng, Yaonan Jin

CoRR, 2024

Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer.

Yaonan Jin, Pinyan Lu

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

First Price Auction is 1-1/<i>e</i>² Efficient.

Yaonan Jin, Pinyan Lu

J. ACM, October, 2023

Bayesian Auction Design and Approximation

Yaonan Jin

PhD thesis, 2023

The Price of Stability for First Price Auction.

Yaonan Jin, Pinyan Lu

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Learning Reserve Prices in Second-Price Auctions.

Yaonan Jin, Pinyan Lu, Tao Xiao

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Subset Sum in Time 2^n/2 / poly(n).

Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio

Proceedings of the Approximation, 2023

2022

Settling the Efficiency of the First-Price Auction.

Yaonan Jin, Pinyan Lu

SIGecom Exch., 2022

Tight Revenue Gaps among Multiunit Mechanisms.

Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang

SIAM J. Comput., 2022

Average-Case Subset Balancing Problems.

Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

First Price Auction is 1 - 1 /e² Efficient.

Yaonan Jin, Pinyan Lu

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Fourier growth of structured 𝔽₂-polynomials and applications.

Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola

Electron. Colloquium Comput. Complex., 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

Tight Revenue Gaps among Multi-Unit Mechanisms.

Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

Optimal Budget-Feasible Mechanisms for Additive Valuations.

Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang

ACM Trans. Economics and Comput., 2020

Tight Revenue Gaps Among Simple Mechanisms.

Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao

SIAM J. Comput., 2020

A robust multi-dimensional sparse Fourier transform in the continuous setting.

Yaonan Jin, Daogao Liu, Zhao Song

CoRR, 2020

2019

Tight revenue gaps among simple and optimal mechanisms.

Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao

SIGecom Exch., 2019

On the Approximability of Simple Mechanisms for MHR Distributions.

Yaonan Jin, Weian Li, Qi Qi

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Tight approximation ratio of anonymous pricing.

Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019