Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games

by   Xavier Allamigeon, et al.

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 an oracle, evaluating the dynamic programming operator up to a given precision. We show that the number of calls to the oracle needed to determine exact optimal (positional) strategies is, up to a factor polynomial in the dimension, of order R/sep, where the "separation" sep is defined as the minimal difference between distinct values arising from strategies, and R is a metric estimate, involving the norm of approximate sub and super-eigenvectors of the dynamic programming operator. We illustrate this method by two applications. The first one is a new proof, leading to improved complexity estimates, of a theorem of Boros, Elbassioni, Gurvich and Makino, showing that turn-based mean-payoff games with a fixed number of random positions can be solved in pseudo-polynomial time. The second one concerns entropy games, a model introduced by Asarin, Cervelle, Degorre, Dima, Horn and Kozyakin. The rank of an entropy game is defined as the maximal rank among all the ambiguity matrices determined by strategies of the two players. We show that entropy games with a fixed rank, in their original formulation, can be solved in polynomial time, and that an extension of entropy games incorporating weights can be solved in pseudo-polynomial time under the same fixed rank condition.


page 1

page 2

page 3

page 4


The operator approach to entropy games

Entropy games and matrix multiplication games have been recently introdu...

Faster Evaluation of Subtraction Games

Subtraction games are played with one or more heaps of tokens, with play...

Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem

The automaton constrained tree knapsack problem is a variant of the knap...

3XOR Games with Perfect Commuting Operator Strategies Have Perfect Tensor Product Strategies and are Decidable in Polynomial Time

We consider 3XOR games with perfect commuting operator strategies. Given...

Solving irreducible stochastic mean-payoff games and entropy games by relative Krasnoselskii-Mann iteration

We analyse an algorithm solving stochastic mean-payoff games, combining ...

Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography

We settle two long-standing complexity-theoretical questions-open since ...

Exact and rapid linear clustering of networks with dynamic programming

We study the problem of clustering networks whose nodes have imputed or ...

Please sign up or login with your details

Forgot password? Click here to reset