Abstract We study subgame $$\phi $$ ϕ -maxmin strategies in two-player zero-sum stochastic games with a countable state space, finite action spaces, and bounded universally measurable payoff function. Here, denotes the tolerance function that assigns nonnegative tolerated error level to every subgame. Subgame...

We present a simple primal-dual algorithm for computing approximate Nash equilibria in two-person zero-sum sequential games with incomplete information and perfect recall (like Texas Hold’em poker). Our algorithm only performs basic iterations (i.e matvec multiplications, clipping, etc., and no calls to external first-order oracles, no matrix inversions, etc.) and is applicable to a broad class...