Extensive-Form Game Solving via Blackwell Approachability on Treeplexes

We introduce the first algorithmic framework for Blackwell approachability on the sequence-form polytope, the class of convex polytopes capturing the strategies of players in extensive-form games (EFGs).