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. 2406.02357
  4. Cited By
The complexity of approximate (coarse) correlated equilibrium for
  incomplete information games

The complexity of approximate (coarse) correlated equilibrium for incomplete information games

4 June 2024
Binghui Peng
Aviad Rubinstein
ArXivPDFHTML

Papers citing "The complexity of approximate (coarse) correlated equilibrium for incomplete information games"

4 / 4 papers shown
Title
Computational Lower Bounds for Regret Minimization in Normal-Form Games
Computational Lower Bounds for Regret Minimization in Normal-Form Games
Ioannis Anagnostides
Alkis Kalavasis
T. Sandholm
34
0
0
04 Nov 2024
Barriers to Welfare Maximization with No-Regret Learning
Barriers to Welfare Maximization with No-Regret Learning
Ioannis Anagnostides
Alkis Kalavasis
T. Sandholm
38
1
0
04 Nov 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
57
19
0
30 May 2022
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
62
53
0
11 Nov 2021
1