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. 2111.05486
  4. Cited By
Uncoupled Bandit Learning towards Rationalizability: Benchmarks,
  Barriers, and Algorithms

Uncoupled Bandit Learning towards Rationalizability: Benchmarks, Barriers, and Algorithms

10 November 2021
Jibang Wu
Haifeng Xu
Fan Yao
ArXivPDFHTML

Papers citing "Uncoupled Bandit Learning towards Rationalizability: Benchmarks, Barriers, and Algorithms"

3 / 3 papers shown
Title
Near-Optimal No-Regret Learning for Correlated Equilibria in
  Multi-Player General-Sum Games
Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games
Ioannis Anagnostides
C. Daskalakis
Gabriele Farina
Maxwell Fishelson
Noah Golowich
T. Sandholm
48
53
0
11 Nov 2021
Nash Convergence of Mean-Based Learning Algorithms in First Price
  Auctions
Nash Convergence of Mean-Based Learning Algorithms in First Price Auctions
Xiaotie Deng
Xinyan Hu
Tao Lin
Weiqiang Zheng
38
9
0
08 Oct 2021
Kernel-based methods for bandit convex optimization
Kernel-based methods for bandit convex optimization
Sébastien Bubeck
Ronen Eldan
Y. Lee
76
164
0
11 Jul 2016
1