research
∙
07/20/2023
Player-optimal Stable Regret for Bandit Learning in Matching Markets
The problem of matching markets has been studied for a long time in the ...
share
research
∙
03/13/2023
Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithm
The linear bandit problem has been studied for many years in both stocha...
research
∙
02/14/2023
Improved Regret Bounds for Linear Adversarial MDPs via Linear Optimization
Learning Markov decision processes (MDP) in an adversarial environment h...
research
∙
06/16/2022
Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback
The problem of online learning with graph feedback has been extensively ...
research
∙
04/26/2022
Thompson Sampling for Bandit Learning in Matching Markets
The problem of two-sided matching markets has a wide range of real-world...
research
∙
11/08/2021
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle
Thompson sampling (TS) has attracted a lot of interest in the bandit are...
research
∙
11/12/2020
Online Influence Maximization under Linear Threshold Model
Online influence maximization (OIM) is a popular problem in social netwo...
research
∙
05/06/2020