We conduct some preliminary experiments on Kuhn [1]} and Leduc poker [2]} which are simplified versions of classic Texas hold'em poker via the OpenSpiel library [3]}. In our experiments, the objective function being minimized is the sum of all local potential functions at all infosets. Ideally, we would like to be able to choose a different iteration weight for each infoset of the game, but retaining the theoretical guarantees of convergence rates via Theorem REF  requires that the weighting used for all infosets on a given iteration must be equal. Empirically, consistent with our normal-form experiments with two-player zero-sum games described in Appendix , we find that setting a relatively high weight floor works best. Experiments described in Figure REF  were run with a minimum weight floor of \(100\%\)  of the average weight accrued thus far. Figure REF  describes the results for various floor amounts in Kuhn Poker.
