Yaonan Jin

Orcid: 0000-0001-6256-7625

According to our database1, Yaonan Jin authored at least 20 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
First Price Auction is 1-1/<i>e</i><sup>2</sup> Efficient.
J. ACM, October, 2023

Bayesian Auction Design and Approximation
PhD thesis, 2023

The Price of Stability for First Price Auction.
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.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Learning Reserve Prices in Second-Price Auctions.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Subset Sum in Time 2<sup>n/2</sup> / poly(n).
Proceedings of the Approximation, 2023

2022
Settling the Efficiency of the First-Price Auction.
SIGecom Exch., 2022

Tight Revenue Gaps among Multiunit Mechanisms.
SIAM J. Comput., 2022

Average-Case Subset Balancing Problems.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

First Price Auction is 1 - 1 /e<sup>2</sup> Efficient.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Fourier growth of structured 𝔽<sub>2</sub>-polynomials and applications.
Electron. Colloquium Comput. Complex., 2021

Fourier growth of structured $\mathbb{F}_2$-polynomials and applications.
CoRR, 2021

Tight Revenue Gaps among Multi-Unit Mechanisms.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020
Optimal Budget-Feasible Mechanisms for Additive Valuations.
ACM Trans. Economics and Comput., 2020

Tight Revenue Gaps Among Simple Mechanisms.
SIAM J. Comput., 2020

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

2019
Tight revenue gaps among simple and optimal mechanisms.
SIGecom Exch., 2019

On the Approximability of Simple Mechanisms for MHR Distributions.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Tight approximation ratio of anonymous pricing.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019


  Loading...