default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaonan Jin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Yaonan Jin, Pinyan Lu:
Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer. FOCS 2024: 1251-1259- [i13]Yiding Feng, Yaonan Jin:
Beyond Regularity: Simple versus Optimal Mechanisms, Revisited. CoRR abs/2411.03583 (2024) - 2023
- [b1]Yaonan Jin:
Bayesian Auction Design and Approximation. Columbia University, USA, 2023 - [j6]Yaonan Jin
, Pinyan Lu:
First Price Auction is 1-1/e2 Efficient. J. ACM 70(5): 36:1-36:86 (2023) - [c12]Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio:
Subset Sum in Time 2n/2 / poly(n). APPROX/RANDOM 2023: 39:1-39:18 - [c11]Yaonan Jin, Pinyan Lu, Tao Xiao:
Learning Reserve Prices in Second-Price Auctions. ITCS 2023: 75:1-75:24 - [c10]Yaonan Jin, Pinyan Lu:
The Price of Stability for First Price Auction. SODA 2023: 332-352 - [c9]Yaonan Jin, Daogao Liu, Zhao Song:
Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample Complexity. SODA 2023: 4667-4767 - [i12]Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio:
Subset Sum in Time 2n/2/poly(n). CoRR abs/2301.07134 (2023) - 2022
- [j5]Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang:
Tight Revenue Gaps among Multiunit Mechanisms. SIAM J. Comput. 51(5): 1535-1579 (2022) - [j4]Yaonan Jin, Pinyan Lu:
Settling the Efficiency of the First-Price Auction. SIGecom Exch. 20(2): 69-74 (2022) - [c8]Yaonan Jin, Pinyan Lu:
First Price Auction is 1 - 1 /e2 Efficient. FOCS 2022: 179-187 - [c7]Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio:
Average-Case Subset Balancing Problems. SODA 2022: 743-778 - [i11]Yaonan Jin, Pinyan Lu:
First Price Auction is 1 - 1/e2 Efficient. CoRR abs/2207.01761 (2022) - [i10]Yaonan Jin, Pinyan Lu:
The Price of Stability for First Price Auction. CoRR abs/2207.04455 (2022) - 2021
- [c6]Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola:
Fourier Growth of Structured 𝔽2-Polynomials and Applications. APPROX-RANDOM 2021: 53:1-53:20 - [c5]Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang:
Tight Revenue Gaps among Multi-Unit Mechanisms. EC 2021: 654-673 - [i9]Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang:
Tight Revenue Gaps among Multi-Unit Mechanisms. CoRR abs/2102.07454 (2021) - [i8]Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola:
Fourier growth of structured $\mathbb{F}_2$-polynomials and applications. CoRR abs/2107.10797 (2021) - [i7]Xi Chen, Yaonan Jin, Tim Randolph, Rocco A. Servedio:
Average-Case Subset Balancing Problems. CoRR abs/2110.14607 (2021) - [i6]Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola:
Fourier growth of structured 𝔽2-polynomials and applications. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j3]Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao:
Tight Revenue Gaps Among Simple Mechanisms. SIAM J. Comput. 49(5): 927-958 (2020) - [j2]Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang:
Optimal Budget-Feasible Mechanisms for Additive Valuations. ACM Trans. Economics and Comput. 8(4): 21:1-21:15 (2020) - [i5]Yaonan Jin, Daogao Liu, Zhao Song:
A robust multi-dimensional sparse Fourier transform in the continuous setting. CoRR abs/2005.06156 (2020)
2010 – 2019
- 2019
- [j1]Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao:
Tight revenue gaps among simple and optimal mechanisms. SIGecom Exch. 17(2): 54-61 (2019) - [c4]Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang:
Optimal Budget-Feasible Mechanisms for Additive Valuations. EC 2019: 887-900 - [c3]Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao:
Tight Revenue Gaps among Simple Mechanisms. SODA 2019: 209-228 - [c2]Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao:
Tight approximation ratio of anonymous pricing. STOC 2019: 674-685 - [c1]Yaonan Jin, Weian Li, Qi Qi:
On the Approximability of Simple Mechanisms for MHR Distributions. WINE 2019: 228-240 - [i4]Nick Gravin, Yaonan Jin, Pinyan Lu, Chenhao Zhang:
Optimal Budget-Feasible Mechanisms for Additive Valuations. CoRR abs/1902.04635 (2019) - [i3]Yaonan Jin, Pinyan Lu, Tao Xiao:
Learning Reserve Prices in Second-Price Auctions. CoRR abs/1912.10069 (2019) - 2018
- [i2]Yaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao:
Tight Revenue Gaps among Simple Mechanisms. CoRR abs/1804.00480 (2018) - [i1]Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao:
Tight Approximation Ratio of Anonymous Pricing. CoRR abs/1811.00763 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
