Showing cs.GTShow all
2 papers · 1 filter
cs.GT2025
Thresholds for sensitive optimality and Blackwell optimality in stochastic games
Stéphane Gaubert, Julien Grand-Clément, Ricardo D. Katz
We investigate refinements of the mean-payoff criterion in two-player zero-sum perfect-information stochastic games. A strategy is Blackwell optimal if it is optimal in the discoun…
cs.GT2024
Universal Complexity Bounds Based on Value Iteration for Stochastic Mean Payoff Games and Entropy Games
Xavier Allamigeon, Stéphane Gaubert, Ricardo D. Katz +1
We develop value iteration-based algorithms to solve in a unified manner different classes of combinatorial zero-sum games with mean-payoff type rewards. These algorithms rely on a…