default search action
Yingkai Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Yingkai Li
, Yining Wang
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. IEEE Trans. Inf. Theory 70(1): 372-388 (2024) - [c25]Yannai A. Gonczarowski, Nicole Immorlica, Yingkai Li, Brendan Lucier:
Revenue Maximization for Buyers with Costly Participation. SODA 2024: 41-73 - [c24]Yingkai Li, Shufei Wang, Yibin Zhang, Hao Huang, Yu Wang, Qianyun Zhang, Yun Lin, Guan Gui:
Multi-Modal Fusion for Enhanced Automatic Modulation Classification. VTC Spring 2024: 1-5 - [i31]Yang Cai, Yingkai Li, Jinzhao Wu:
Algorithmic Information Disclosure in Optimal Auctions. CoRR abs/2403.08145 (2024) - [i30]Yingkai Li, Boli Xu:
Falsifiable Test Design in Coordination Games. CoRR abs/2405.18521 (2024) - [i29]Yingkai Li, Argyris Oikonomou:
Dynamics and Contracts for an Agent with Misspecified Beliefs. CoRR abs/2405.20423 (2024) - 2023
- [j4]Jiarui Gan, Bo Li, Yingkai Li:
Your College Dorm and Dormmates: Fair Resource Sharing with Externalities. J. Artif. Intell. Res. 77: 793-820 (2023) - [c23]Jason D. Hartline, Liren Shan, Yingkai Li, Yifan Wu:
Optimal Scoring Rules for Multi-dimensional Effort. COLT 2023: 2624-2650 - [c22]Moshe Babaioff, Nicole Immorlica, Yingkai Li, Brendan Lucier:
Making Auctions Robust to Aftermarkets. ITCS 2023: 9:1-9:23 - [c21]Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, Aleksandrs Slivkins:
Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence. ITCS 2023: 52:1-52:1 - [c20]Tal Alon
Bayesian Analysis of Linear Contracts. EC 2023: 66 - [c19]Yiding Feng
Simple Mechanisms for Non-linear Agents. SODA 2023: 3802-3816 - [i28]Yingkai Li, Xiaoyun Qiu:
Contests as Optimal Mechanisms under Signal Manipulation. CoRR abs/2302.09168 (2023) - [i27]Dirk Bergemann, Tan Gan, Yingkai Li:
Managing Persuasion Robustly: The Optimality of Quota Rules. CoRR abs/2310.10024 (2023) - [i26]Yingkai Li, Jonathan Libgober:
Optimal Scoring for Dynamic Information Acquisition. CoRR abs/2310.19147 (2023) - 2022
- [j3]Jing Chen, Bo Li
Bayesian auctions with efficient queries. Artif. Intell. 303: 103630 (2022) - [c18]Jing Chen, Bo Li, Yingkai Li, Pinyan Lu:
Bayesian Auctions with Efficient Queries (Extended Abstract). IJCAI 2022: 5708-5712 - [c17]Yingkai Li:
Selling Data to an Agent with Endogenous Information. EC 2022: 664-665 - [c16]Yingkai Li, Jason D. Hartline, Liren Shan, Yifan Wu
Optimization of Scoring Rules. EC 2022: 988-989 - [c15]Bo Li, Yingkai Li, Xiaowei Wu
Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱. WWW 2022: 122-131 - [i25]Yingkai Li, Aleksandrs Slivkins:
Incentivizing Participation in Clinical Trials. CoRR abs/2202.06191 (2022) - [i24]Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, Aleksandrs Slivkins:
Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence. CoRR abs/2205.08674 (2022) - [i23]Jason D. Hartline, Liren Shan, Yingkai Li, Yifan Wu:
Optimal Scoring Rules for Multi-dimensional Effort. CoRR abs/2211.03302 (2022) - [i22]Tal Alon, Paul Dütting, Yingkai Li, Inbal Talgam-Cohen:
Bayesian Analysis of Linear Contracts. CoRR abs/2211.06850 (2022) - 2021
- [j2]Yingkai Li, Harry Pei:
Equilibrium behaviors in repeated games. J. Econ. Theory 193: 105222 (2021) - [c14]Yingkai Li, Yining Wang, Xi Chen, Yuan Zhou:
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits. AISTATS 2021: 370-378 - [c13]Yiding Feng
Revelation gap for pricing from samples. STOC 2021: 1438-1451 - [i21]Yiding Feng, Jason D. Hartline, Yingkai Li:
Revelation Gap for Pricing from Samples. CoRR abs/2102.13496 (2021) - [i20]Yannai A. Gonczarowski, Nicole Immorlica, Yingkai Li, Brendan Lucier:
Revenue Maximization for Buyers with Outside Options. CoRR abs/2103.03980 (2021) - [i19]Yingkai Li:
Selling Data to an Agent with Endogenous Information. CoRR abs/2103.05788 (2021) - [i18]Bo Li, Yingkai Li, Xiaowei Wu:
Almost Proportional Allocations for Indivisible Chores. CoRR abs/2103.11849 (2021) - [i17]Moshe Babaioff, Nicole Immorlica, Yingkai Li, Brendan Lucier:
On the Impact of Information Acquisition and Aftermarkets on Auction Efficiency. CoRR abs/2107.05853 (2021) - 2020
- [c12]Bo Li, Yingkai Li:
Fair Resource Sharing and Dorm Assignment. AAMAS 2020: 708-716 - [c11]Jason D. Hartline, Aleck C. Johnsen, Yingkai Li:
Benchmark Design and Prior-independent Optimization. FOCS 2020: 294-305 - [c10]Kefan Dong, Yingkai Li, Qin Zhang
Multinomial Logit Bandit with Low Switching Cost. ICML 2020: 2607-2615 - [i16]Jason D. Hartline, Aleck C. Johnsen, Yingkai Li:
Benchmark Design and Prior-independent Optimization. CoRR abs/2001.10157 (2020) - [i15]Yiding Feng, Jason D. Hartline, Yingkai Li:
Simple Mechanisms for Non-linear Agents. CoRR abs/2003.00545 (2020) - [i14]Jason D. Hartline, Yingkai Li, Liren Shan, Yifan Wu:
Optimization of Scoring Rules. CoRR abs/2007.02905 (2020) - [i13]Kefan Dong, Yingkai Li, Qin Zhang, Yuan Zhou:
Multinomial Logit Bandit with Low Switching Cost. CoRR abs/2007.04876 (2020) - [i12]Jiarui Gan, Bo Li, Yingkai Li:
Fair Resource Sharing with Externailities. CoRR abs/2012.04522 (2020)
2010 – 2019
- 2019
- [j1]Jing Chen, Bo Li
Efficient Approximations for the Online Dispersion Problem. SIAM J. Comput. 48(2): 373-416 (2019) - [c9]Yingkai Li, Pinyan Lu, Haoran Ye:
Revenue Maximization with Imprecise Distribution. AAMAS 2019: 1582-1590 - [c8]Yingkai Li, Yining Wang, Yuan Zhou:
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. COLT 2019: 2173-2174 - [c7]Yiding Feng
Optimal Auctions vs. Anonymous Pricing: Beyond Linear Utility. EC 2019: 885-886 - [c6]Jing Chen, Bo Li
Approximately Maximizing the Broker's Profit in a Two-sided Market. IJCAI 2019: 151-157 - [i11]Yingkai Li, Pinyan Lu, Haoran Ye:
Revenue Maximization with Imprecise Distribution. CoRR abs/1903.00836 (2019) - [i10]Yingkai Li, Yining Wang, Yuan Zhou:
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits. CoRR abs/1904.00242 (2019) - [i9]Yingkai Li, Yining Wang, Yuan Zhou:
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits. CoRR abs/1905.01435 (2019) - [i8]Yiding Feng, Jason D. Hartline, Yingkai Li:
Optimal Auctions vs. Anonymous Pricing: Beyond Linear Utility. CoRR abs/1905.04257 (2019) - [i7]Jing Chen, Bo Li, Yingkai Li:
Approximately Maximizing the Broker's Profit in a Two-sided Market. CoRR abs/1905.09347 (2019) - [i6]Yingkai Li, Edmund Y. Lou, Liren Shan:
Stochastic Linear Optimization with Adversarial Corruption. CoRR abs/1909.02109 (2019) - 2018
- [c5]Jing Chen, Bo Li
Brief Announcement: Bayesian Auctions with Efficient Queries. ICALP 2018: 108:1-108:4 - [c4]Bo Li
Dynamic Fair Division Problem with General Valuations. IJCAI 2018: 375-381 - [c3]Jing Chen, Bo Li
Information Elicitation for Bayesian Auctions. SAGT 2018: 43-55 - [i5]Bo Li, Yingkai Li:
Dynamic Fair Division Problem with General Valuations. CoRR abs/1802.05294 (2018) - [i4]Jing Chen, Bo Li, Yingkai Li, Pinyan Lu:
Bayesian Auctions with Efficient Queries. CoRR abs/1804.07451 (2018) - [i3]Yingkai Li, Huidong Liu:
Implementation of Stochastic Quasi-Newton's Method in PyTorch. CoRR abs/1805.02338 (2018) - 2017
- [c2]Jing Chen, Bo Li
Efficient Approximations for the Online Dispersion Problem. ICALP 2017: 11:1-11:15 - [i2]Jing Chen, Bo Li, Yingkai Li:
From Bayesian to Crowdsourced Bayesian Auctions. CoRR abs/1702.01416 (2017) - [i1]Jing Chen, Bo Li, Yingkai Li:
Efficient Approximations for the Online Dispersion Problem. CoRR abs/1704.06823 (2017) - 2011
- [c1]Zhiwei Weng, Jian Weng
New Chosen Ciphertext Secure Public Key Encryption in the Standard Model with Public Verifiability. ICIC (2) 2011: 170-176
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 2024-10-10 22:14 CEST 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: