A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Combinatorial structure and randomized subexponential algorithms for infinite games
Theoretical Computer Science
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics
Cyclic games and linear programming
Discrete Applied Mathematics
Games through Nested Fixpoints
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Faster algorithms for mean-payoff games
Formal Methods in System Design
Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Linear programming polytope and algorithm for mean payoff games
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
The complexity of infinitely repeated alternating move games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.00 |
We study the mean cost cyclical game in a more general setting than that in Gurvitch et al. (1988) and Karzanow and Lebedev (1993). The game is played on a directed graph and generalizes the single source shortest path problem, the minimum mean cycle problem (see Karp 1978), and the ergodic extension of matrix games (Moulin 1976). We prove the existence of a solution in uniform stationary strategies and present an algorithm for finding such optimal strategies. In fact, our algorithm is an extension of the algorithms due to Gurvitch et al. (1988) and Karzanow and Lebedev (1993), which were proved to be finite, but exponential in the worst case. We prove that all these algorithms are pseudopolynomial.