The complexity of mean payoff games on graphs
- 1 May 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 158 (1-2) , 343-359
- https://doi.org/10.1016/0304-3975(95)00188-3
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic gamesCybernetics and Systems Analysis, 1994
- Undirected edge geographyTheoretical Computer Science, 1993
- Complexity of path-forming gamesTheoretical Computer Science, 1993
- GeographyTheoretical Computer Science, 1993
- An O(n2) algorithm for the maximum cycle mean of an n×n bivalent matrixDiscrete Applied Mathematics, 1992
- Faster parametric shortest path and minimum‐balance algorithmsNetworks, 1991
- Cyclic games and an algorithm to find minimax cycle means in directed graphsUSSR Computational Mathematics and Mathematical Physics, 1988
- Selection and sorting with limited storageTheoretical Computer Science, 1980
- Positional strategies for mean payoff gamesInternational Journal of Game Theory, 1979
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978