Equilibrium Refinements Improve Subgame Solving in Imperfect-Information Games
arXiv:2601.17131v1 Announce Type: new Abstract: Subgame solving is a technique for scaling algorithms to large games by locally refining a precomputed blueprint strategy during gameplay. While straightforward in perfect-information games where search starts from the current state, subgame solving in imperfect-information games must account for hidden states and uncertainty about the opponent’s past strategy. Gadget games were developed to ensure that the improved subgame strategy is robust against any possible opponent’s strategy in a zero-sum game. Gadget games […]