Tracking the Best Strategy in an Extensive-Form Game

arXiv:2608.09501v1 Announce Type: new Abstract: We consider the extensive-form bandit problem where on each trial the learner plays an extensive-form game against an oblivious adversary. We focus on the notion of switching regret, which measures the expected performance of the learner against that of any switching sequence of mixed strategies in retrospect. Our algorithm takes a parameter rho>0 and achieves a switching regret of ilde{O}((1/rho+rho K)sqrt{H A T}) where K is the number of switches in the comparator sequence, H is the maximum number of the learner's information sets that can be traversed during a play of the game and A is the number of actions that the learner can possibly take. Our algorithm is extremely efficient, taking a per trial time of only O(H B) where B is the maximum number of actions available to the learner at any of its information sets.

Source: arXiv cs.LG | 2026-08-11