ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2307.10890
  4. Cited By
Player-optimal Stable Regret for Bandit Learning in Matching Markets

Player-optimal Stable Regret for Bandit Learning in Matching Markets

20 July 2023
Fang-yuan Kong
Shuai Li
ArXivPDFHTML

Papers citing "Player-optimal Stable Regret for Bandit Learning in Matching Markets"

4 / 4 papers shown
Title
Thompson Sampling for Bandit Learning in Matching Markets
Thompson Sampling for Bandit Learning in Matching Markets
Fang-yuan Kong
Junming Yin
Shuaiqi Li
28
17
0
26 Apr 2022
Beyond $\log^2(T)$ Regret for Decentralized Bandits in Matching Markets
Beyond log⁡2(T)\log^2(T)log2(T) Regret for Decentralized Bandits in Matching Markets
Soumya Basu
Karthik Abinav Sankararaman
Abishek Sankararaman
49
34
0
12 Mar 2021
Learning in Multi-Stage Decentralized Matching Markets
Learning in Multi-Stage Decentralized Matching Markets
Xiaowu Dai
Michael I. Jordan
31
20
0
13 Feb 2021
Competing Bandits in Matching Markets
Competing Bandits in Matching Markets
Lydia T. Liu
Horia Mania
Michael I. Jordan
49
88
0
12 Jun 2019
1