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. 2206.00120
  4. Cited By
Decentralized Competing Bandits in Non-Stationary Matching Markets

Decentralized Competing Bandits in Non-Stationary Matching Markets

31 May 2022
Avishek Ghosh
Abishek Sankararaman
Kannan Ramchandran
T. Javidi
A. Mazumdar
ArXivPDFHTML

Papers citing "Decentralized Competing Bandits in Non-Stationary Matching Markets"

3 / 3 papers shown
Title
Explore-then-Commit Algorithms for Decentralized Two-Sided Matching
  Markets
Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets
Tejas Pagare
Avishek Ghosh
20
0
0
16 Aug 2024
Player-optimal Stable Regret for Bandit Learning in Matching Markets
Player-optimal Stable Regret for Bandit Learning in Matching Markets
Fang-yuan Kong
Shuai Li
15
11
0
20 Jul 2023
Competing Bandits in Time Varying Matching Markets
Competing Bandits in Time Varying Matching Markets
Deepan Muthirayan
C. Maheshwari
Pramod P. Khargonekar
S. Shankar Sastry
25
1
0
21 Oct 2022
1