| Tight approximation ratio of anonymous pricing Y Jin, P Lu, Q Qi, ZG Tang, T Xiao Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 38 | 2019 |
| Tight revenue gaps among simple mechanisms Y Jin, P Lu, ZG Tang, T Xiao SIAM Journal on Computing 49 (5), 927-958, 2020 | 36 | 2020 |
| Optimal budget-feasible mechanisms for additive valuations N Gravin, Y Jin, P Lu, C Zhang ACM Transactions on Economics and Computation (TEAC) 8 (4), 1-15, 2020 | 31 | 2020 |
| First Price Auction is 1-1/e2 Efficient Y Jin, P Lu Journal of the ACM 70 (5), 1-86, 2023 | 18 | 2023 |
| A robust multi-dimensional sparse fourier transform in the continuous setting Y Jin, D Liu, Z Song arXiv preprint arXiv:2005.06156 2 (1), 2020 | 12 | 2020 |
| Average-case subset balancing problems X Chen, Y Jin, T Randolph, RA Servedio Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 11 | 2022 |
| Fourier Growth of Structured 𝔽₂-Polynomials and Applications J Błasiok, P Ivanov, Y Jin, CH Lee, RA Servedio, E Viola Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2021 | 11 | 2021 |
| Tight revenue gaps among multi-unit mechanisms Y Jin, S Jiang, P Lu, H Zhang Proceedings of the 22nd ACM Conference on Economics and Computation, 654-673, 2021 | 10 | 2021 |
| Super-resolution and robust sparse continuous fourier transform in any constant dimension: Nearly linear time and sample complexity Y Jin, D Liu, Z Song Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 9 | 2023 |
| On the approximability of simple mechanisms for MHR distributions Y Jin, W Li, Q Qi International Conference on Web and Internet Economics, 228-240, 2019 | 8 | 2019 |
| Learning reserve prices in second-price auctions Y Jin, P Lu, T Xiao arXiv preprint arXiv:1912.10069, 2019 | 6 | 2019 |
| The price of stability for first price auction Y Jin, P Lu Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 5 | 2023 |
| On asymptotically tight tail bounds for sums of geometric and exponential random variables Y Jin, Y Li, Y Wang, Y Zhou arXiv preprint arXiv:1902.02852, 2019 | 5 | 2019 |
| Subset Sum in Time X Chen, Y Jin, T Randolph, RA Servedio arXiv preprint arXiv:2301.07134, 2023 | 4 | 2023 |
| Settling the Efficiency of the First-Price Auction Y Jin, P Lu ACM SIGecom Exchanges 20 (2), 69-74, 2024 | 2 | 2024 |
| Tight revenue gaps among simple and optimal mechanisms Y Jin, P Lu, Q Qi, ZG Tang, T Xiao ACM SIGecom Exchanges 17 (2), 54-61, 2020 | 2 | 2020 |
| Beyond Regularity: Simple versus Optimal Mechanisms, Revisited Y Feng, Y Jin arXiv preprint arXiv:2411.03583, 2024 | | 2024 |
| Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer Y Jin, P Lu 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024 | | 2024 |
| Bayesian Auction Design and Approximation Y Jin Columbia University, 2023 | | 2023 |
| Fourier Growth of Structured 𝔽-Polynomials and Applications J Blasiok, P Ivanov, Y Jin, CH Lee, RA Servedio, E Viola APPROX-RANDOM, 2021 | | 2021 |
Pinyan LuITCS, Shanghai University of Finance and EconomicsE-mailová adresa ověřena na: mail.shufe.edu.cn
