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. 2202.12277
  4. Cited By
Solving optimization problems with Blackwell approachability

Solving optimization problems with Blackwell approachability

24 February 2022
Julien Grand-Clément
Christian Kroer
ArXiv (abs)PDFHTML

Papers citing "Solving optimization problems with Blackwell approachability"

3 / 3 papers shown
Title
Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
Yang Cai
Gabriele Farina
Julien Grand-Clément
Christian Kroer
Chung-Wei Lee
Haipeng Luo
Weiqiang Zheng
80
2
0
01 Nov 2023
Regret Matching+: (In)Stability and Fast Convergence in Games
Regret Matching+: (In)Stability and Fast Convergence in Games
Gabriele Farina
Julien Grand-Clément
Christian Kroer
Chung-Wei Lee
Haipeng Luo
57
7
0
24 May 2023
DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker
DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker
Matej Moravcík
Martin Schmid
Neil Burch
Viliam Lisý
Dustin Morrill
Nolan Bard
Trevor Davis
Kevin Waugh
Michael Bradley Johanson
Michael Bowling
BDL
261
913
0
06 Jan 2017
1