Yingkai Li (李瑛恺)
I am a final year PhD student at the Department of Computer Science, Northwestern University.
I am pleased to be advised by Prof. Jason Hartline.
I received my BS in Computer Science from Shanghai Jiaotong University in 2015 and MS in Computer Science from Stony Brook University in 2018.
Here is my CV.
- Mechanism Design
- Information Design
- Repeated Game
- Algorithmic Game Theory
- Online Algorithms
Selling Data to an Agent with Endogenous Information.
Optimization of Scoring Rules.
joint work with , EC 2022, best poster award at EC 2020
Almost Proportional Allocations for Indivisible Chores.
joint work with , WebConf 2022
Revelation Gap for Pricing from Samples.
joint work with , STOC 2021
Tight Regret Bounds for Infinite-armed Linear Contextual Bandits.
joint work with , AISTATS 2021
Benchmark Design and Prior-independent Optimization.
joint work with , FOCS 2020
Multinomial Logit Bandit with Low Switching Cost.
joint work with , ICML 2020
Fair Resource Sharing and Dorm Assignments.
joint work with , AAMAS 2020
Approximately Maximizing the Broker’s Profit in a Two-sided Market.
joint work with , IJCAI 2019
Optimal Auctions vs. Anonymous Pricing: Beyond Linear Utility.
joint work with , EC 2019
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits.
joint work with , COLT 2019
Revenue Maximization with Imprecise Distribution.
joint work with , AAMAS 2019
Information Elicitation for Bayesian Auctions.
joint work with , SAGT 2018
Dynamic Fair Division Problem with General Valuations.
joint work with , IJCAI 2018
Bayesian Auctions with Efficient Queries.
joint work with , ICALP 2018 (Brief Announcement)
Efficient Approximations for the Online Dispersion Problem.
joint work with , ICALP 2017