Safe Subgame Resolving in Multiplayer Games
This paper introduces a conditional safety theorem and post-hoc certificate for uncorrelated subgame resolving in multiplayer games with hidden information. The bound limits the resolved profile's best-response gap increase using four terms: unrealized blueprint subgame value, resolver solve error, opponents' best-response gains, and a structural tax that vanishes in constant-sum games. Experiments on three-player Leduc and Kuhn poker with up to six players show uncertified resolving harms performance in 12% to 100% of updates, while the certificate flags those updates and accepts 41% of Kuhn and 86% of Leduc standard updates. A resolver that keeps the blueprint when the certificate exceeds tolerance avoids harmful updates, and the certificate requires one best-response pass per opponent.