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.06008
  4. Cited By
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

11 November 2021
Ioannis Anagnostides
C. Daskalakis
Gabriele Farina
Maxwell Fishelson
Noah Golowich
T. Sandholm
ArXivPDFHTML

Papers citing "Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games"

5 / 5 papers shown
Title
Decentralized Online Learning in General-Sum Stackelberg Games
Decentralized Online Learning in General-Sum Stackelberg Games
Yaolong Yu
Haipeng Chen
22
0
0
06 May 2024
Efficient Phi-Regret Minimization in Extensive-Form Games via Online
  Mirror Descent
Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent
Yu Bai
Chi Jin
Song Mei
Ziang Song
Tiancheng Yu
OffRL
44
18
0
30 May 2022
Independent Natural Policy Gradient Methods for Potential Games:
  Finite-time Global Convergence with Entropy Regularization
Independent Natural Policy Gradient Methods for Potential Games: Finite-time Global Convergence with Entropy Regularization
Shicong Cen
Fan Chen
Yuejie Chi
8
15
0
12 Apr 2022
Uncoupled Bandit Learning towards Rationalizability: Benchmarks,
  Barriers, and Algorithms
Uncoupled Bandit Learning towards Rationalizability: Benchmarks, Barriers, and Algorithms
Jibang Wu
Haifeng Xu
Fan Yao
12
1
0
10 Nov 2021
Blackwell Approachability and Low-Regret Learning are Equivalent
Blackwell Approachability and Low-Regret Learning are Equivalent
Jacob D. Abernethy
Peter L. Bartlett
Elad Hazan
67
108
0
08 Nov 2010
1