The complexity of mean payoff games on graphs

Theoretical Computer Science

Volumn 158, Issue 1-2, 1996, Pages 343-359

  Zwick, Uri ^a   Paterson, Mike ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; GAME THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; RANDOM PROCESSES;

MEAN PAYOFF GAMES; POLYNOMIAL REDUCTION; SIMPLE STOCHASTIC GAMES;

COMPUTATIONAL COMPLEXITY;

EID: 0030143640     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00188-3     Document Type: Article

References (24)

1. S. Alpern, Cycles in extensive form perfect information games, J. Math. Anal. Appl. 159 (1991) 1-17.
2. H.L. Bodlaender, Complexity of path-forming games, Theoret Comput Sci. 110 (1993) 215-245.
3. A. Borodin, N. Linial and M.E. Saks. An optimal on-line algorithm for metrical task system J. ACM 39 (1992) 745-763.
4. 2) algorithm for the maximum cycle mean of an n x n bivalent matrix, Discrete Appl. Math. 35 (1992) 157-162.
5. R. Cole, R. Hariharan, M. Paterson and U. Zwick, Tighter lower bounds on the exact complexity of string matching, SIAM J. Comput. 24 (1995) 30-45.
6. A. Condon, The complexity of stochastic games, Inform. Comput. 96 (1992) 203-224.
7. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (The MIT Press, Cambridge, (1990).
8. A. Ehrenfeucht and J. Mycielski, Positional strategies for mean payoff games, Int. J. Game Theory 8 (1979) 109-113.
9. A.S. Fraenkel, E.R. Scheinerman and D. Ullman, Undirected edge geography, Theoret. Comput. Sci. 112 (1993) 371-381.
10. A.S. Fraenkel and S. Simonson, Geography, Theoret Comput. Sci. 110 (1993) 197-213.
11. V.A. Gurvich, A.V. Karzanov and L.G. Khachiyan, Cyclic games and an algorithm to find minimax cycle means in directed graphs, USSR Comput. Math. Math. Phys. 28 (1988) 85-91.
12. R.M. Karp, A characterization of the minimum cycle mean in a digraph, Discrete Math. 23 (1978) 309-311.
13. A.V. Karzanov and V.N. Lebedev, Cyclical games with prohibitions, Math. Programming 60 (1993) 277-293.
14. D.D. Lozovanu, Algorithms to solve some classes of network minimax problems and their applications, Cybernetics 29 (1991) 93-100.
15. D.D. Lozovanu, Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games, Cybernetics Systems Anal. 29 (1993) 754-759.
16. W. Ludwig, A subexponential randomized algorithm for the simple stochastic game problem, Inform. Comput. 117 (1995) 151-155.
17. M. Melekopoglou and A. Condon, On the complexity of the policy iteration algorithm for stochastic games, Technical Report TR 941, University of Wisconsin, June 1990.
18. H. Moulin, Prolongement des jeux a deux joueurs de somme nulle, Bull. Soc. Math. France, Memoires 45 (1976).
19. J.I. Munro and M.S. Paterson, Selection and sorting with limited storage, Theoret. Comput. Sci. 12 (1980) 315-323.
20. J.B. Orlin and R.K. Ahuja, New scaling algorithms for the assignment and minimum mean cycle problems, Math. Programming 54 (1992) 41-56.
21. H.J.M. Peters and O.J. Vrieze, Surveys in game theory and related topics, CWI Tract 39, Centrum voor Wiskunde en Informatica, Amsterdam, 1987.
22. V.R. Pratt, Every prime has a succinct certificate, SIAM J. Comput. 4 (1975) 214-220.
23. L.S. Shapley, Stochastic games, Proc. Nat. Acad. Sci. USA, 39 (1953) 1095-1100.
24. N.E. Young, R.E. Tarjan and J.B. Orlin, Faster parametric shortest path and minimum-balance algorithms, Networks 21 (1991) 205-221.