2 citations · 3 across the 7 of their papers we have counts for
3 papers · 1 filter
Sharper bounds on the thresholds for sensitive and Blackwell optimality
Xavier Allamigeon, Stéphane Gaubert, Julien Grand-Clément +1
In perfect-information two-player stochastic games, the notions of Blackwell and sensitive optimality provide generalizations of the classical mean-payoff optimality and discount o…
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…
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…