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.14737
  4. Cited By
Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning
  via Clairvoyant Multiplicative Weights Update

Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update

29 November 2021
Georgios Piliouras
Ryann Sim
Stratis Skoulakis
ArXivPDFHTML

Papers citing "Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update"

7 / 7 papers shown
Title
On the Interplay between Social Welfare and Tractability of Equilibria
On the Interplay between Social Welfare and Tractability of Equilibria
Ioannis Anagnostides
T. Sandholm
50
2
0
10 Jan 2025
Last Iterate Convergence in Monotone Mean Field Games
Last Iterate Convergence in Monotone Mean Field Games
Noboru Isobe
Kenshi Abe
Kaito Ariu
41
0
0
07 Oct 2024
Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness
Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness
Maayan Ehrenberg
Roy Ganz
Nir Rosenfeld
AAML
56
0
0
17 Jun 2024
Towards Characterizing the First-order Query Complexity of Learning
  (Approximate) Nash Equilibria in Zero-sum Matrix Games
Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games
Hédi Hadiji
Sarah Sachs
T. Erven
Wouter M. Koolen
69
3
0
25 Apr 2023
Near-Optimal $Φ$-Regret Learning in Extensive-Form Games
Near-Optimal ΦΦΦ-Regret Learning in Extensive-Form Games
Ioannis Anagnostides
Gabriele Farina
T. Sandholm
34
7
0
20 Aug 2022
Alternating Mirror Descent for Constrained Min-Max Games
Alternating Mirror Descent for Constrained Min-Max Games
Andre Wibisono
Molei Tao
Georgios Piliouras
24
14
0
08 Jun 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