activity
20172026
most citedNearly Minimax-Optimal Regret for Linearly Parameterized Bandits

62 citations · 128 across the 42 of their papers we have counts for

collaborators
Showing 2020Show all

7 papers · 1 filter

econ.TH2020

Misspecified Beliefs about Time Lags

Yingkai Li, Harry Pei

We examine the long-term behavior of a Bayesian agent who has a misspecified belief about the time lag between actions and feedback, and learns about the payoff consequences of his…

cs.GT2020★ 1 cited

Your College Dorm and Dormmates: Fair Resource Sharing with Externalities

Jiarui Gan, Bo Li, Yingkai Li

We study a fair resource sharing problem, where a set of resources are to be shared among a group of agents. Each agent demands one resource and each resource can serve a limited n…

cs.LG2020★ 4 cited

Multinomial Logit Bandit with Low Switching Cost

Kefan Dong, Yingkai Li, Qin Zhang +1

We study multinomial logit bandit with limited adaptivity, where the algorithms change their exploration actions as infrequently as possible when achieving almost optimal minimax r…

econ.TH2020

Equilibrium Behaviors in Repeated Games

Yingkai Li, Harry Pei

We examine a patient player's behavior when he can build reputations in front of a sequence of myopic opponents. With positive probability, the patient player is a commitment type…

cs.GT2020★ 1 cited

Optimization of Scoring Rules

Jason D. Hartline, Yingkai Li, Liren Shan +1

We characterize the optimal reward functions (scoring rules) that incentivize an agent to acquire information and report it truthfully to the principal. The optimal scoring rules l…

cs.GT2020★ 1 cited

Selling to Non-linear Agents: A Demand-Based Auction

Yiding Feng, Jason Hartline, Yingkai Li

Auctions allocate scarce goods, from car licenses to online advertising, to buyers whose utilities are often not linear in money, as with budgets or risk aversion. We ask how a sel…

cs.GT2020

Benchmark Design and Prior-independent Optimization

Jason Hartline, Aleck Johnsen, Yingkai Li

This paper compares two leading approaches for robust optimization in the models of online algorithms and mechanism design. Competitive analysis compares the performance of an onli…