1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.GT2024
Extensive-Form Game Solving via Blackwell Approachability on Treeplexes
Darshan Chakrabarti, Julien Grand-Clément, Christian Kroer
In this paper, we introduce the first algorithmic framework for Blackwell approachability on the sequence-form polytope, the class of convex polytopes capturing the strategies of p…
cs.GT2023★ 1 cited
Regret Matching+: (In)Stability and Fast Convergence in Games
Gabriele Farina, Julien Grand-Clément, Christian Kroer +2
Regret Matching+ (RM+) and its variants are important algorithms for solving large-scale games. However, a theoretical understanding of their success in practice is still a mystery…