ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2408.08690
  4. Cited By
Explore-then-Commit Algorithms for Decentralized Two-Sided Matching
  Markets

Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets

International Symposium on Information Theory (ISIT), 2024
16 August 2024
Tejas Pagare
Avishek Ghosh
ArXiv (abs)PDFHTML

Papers citing "Explore-then-Commit Algorithms for Decentralized Two-Sided Matching Markets"

2 / 2 papers shown
Title
Optimal Algorithms for Bandit Learning in Matching Markets
Optimal Algorithms for Bandit Learning in Matching Markets
Tejas Pagare
Agniv Bandyopadhyay
Sandeep Juneja
92
0
0
17 Sep 2025
Competing Bandits in Matching Markets via Super Stability
Competing Bandits in Matching Markets via Super Stability
Soumya Basu
79
0
0
19 Jun 2025
1