A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games

Discrete Applied Mathematics

Volumn 155, Issue 2, 2007, Pages 210-229

  Björklund, Henrik ^a   Vorobyov, Sergei ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Combinatorial linear programming; Cyclic game; Ergodic partition; Iterative improvement; Longest shortest parth; Mean payoff game; Parity game; Randomized subexponential algorithm

Indexed keywords

ALGORITHMS; DECISION THEORY; GAME THEORY; ITERATIVE METHODS; PROBLEM SOLVING;

COMBINATORIAL LINEAR PROGRAMMING; CYCLIC GAMES; ERGODIC PARTITION; ITERATIVE IMPROVEMENT; LONGEST SHORTEST PARTH; MEAN PAYOFF GAMES; PARITY GAMES; RANDOMIZED SUBEXPONENTIAL ALGORITHMS;

GRAPH THEORY;

EID: 33751193710     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.04.029     Document Type: Article

References (38)

1. H. Björklund, O. Nilsson, O. Svensson, S. Vorobyov, Controlled linear programming: boundedness and duality, Technical Report DIMACS-2004-56, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, December 2004 〈http://dimacs.rutgers.edu/TechnicalReports/〉.
2. H. Björklund, O. Nilsson, O. Svensson, S. Vorobyov, The controlled linear programming problem, Technical Report DIMACS-2004-41, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, September 2004 〈http://dimacs.rutgers.edu/TechnicalReports/〉.
3. H. Björklund, S. Sandberg, S. Vorobyov, A discrete subexponential algorithm for parity games, in: H. Alt, M. Habib (Eds.), 20th International Symposium on Theoretical Aspects of Computer Science, STACS'2003, Lecture Notes in Computer Science, vol. 2607, Springer, Berlin, 2003, pp. 663-674.
4. H. Björklund, S. Sandberg, S. Vorobyov, On combinatorial structure and algorithms for parity games, Technical Report 2003-002, Department of Information Technology, Uppsala University, January 2003 〈http://www.it.uu.se/research/reports/〉.
5. H. Björklund, S. Sandberg, S. Vorobyov, Randomized subexponential algorithms for parity games, Technical Report 2003-019, Department of Information Technology, Uppsala University, 2003 〈http://www.it.uu.se/research/reports/〉.
6. H. Björklund, S. Sandberg, S. Vorobyov, Complexity of model checking by iterative improvement: the pseudo-Boolean framework, in: M. Broy, A. Zamulin (Eds.), Andrei Ershov Fifth International Conference "Perspectives of System Informatics", Lecture Notes in Computer Science, vol. 2890, 2003, pp. 381-394.
7. Björklund H., Sandberg S., and Vorobyov S. Memoryless determinacy of parity and mean payoff games: a simple proof. Theoret. Comput. Sci. 310 1-3 (2004) 365-378
8. H. Björklund, S. Sandberg, S. Vorobyov, Randomized subexponential algorithms for infinite games, Technical Report DIMACS-2004-09, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, April 2004 〈http://dimacs.rutgers.edu/TechnicalReports/〉.
9. H. Björklund, O. Svensson, S. Vorobyov, Controlled linear programming for infinite games, Technical Report DIMACS-2005-13, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, April 2005 〈http://dimacs.rutgers.edu/TechnicalReports/〉.
10. H. Björklund, O. Svensson, S. Vorobyov, Linear complementarity algorithms for mean payoff games, Technical Report DIMACS-2005-05, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, February 2005 〈http://dimacs.rutgers.edu/TechnicalReports/〉.
11. Björklund H., and Vorobyov S. Combinatorial structure and randomized subexponential algorithms for infinite games. Theoret. Comput. Sci. 349 3 (2005) 347-360
12. Condon A. The complexity of stochastic games. Inform. and Comput. 96 (1992) 203-224
13. Condon A. On algorithms for simple stochastic games. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 13 (1993) 51-71
14. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press and McGraw-Hill Book Company, Cambridge, MA
15. Ehrenfeucht A., and Mycielski J. Positional games over a graph. Notices Amer. Math Soc. 20 (1973) A-334
16. Ehrenfeucht A., and Mycielski J. Positional strategies for mean payoff games. Internat. J. Game Theory 8 (1979) 109-113
17. Emerson E.A. Model checking and the Mu-calculus. In: Immerman N., and Kolaitis Ph.G. (Eds). DIMACS Series in Discrete Mathematics vol. 31 (1997) 185-214
18. Emerson E.A., and Jutla C.S. Tree automata, μ-calculus and determinacy. Annual IEEE Symposium on Foundations of Computer Science (1991) 368-377
19. E.A. Emerson, C. Jutla, A.P. Sistla, On model-checking for fragments of μ-calculus, in: C. Courcoubetis (Ed.), Computer Aided Verification, Proceedings of the Fifth International Conference, Lecture Notes in Computer Science, vol. 697, 1993, pp. 385-396.
20. Gurvich V.A., Karzanov A.V., and Khachiyan L.G. Cyclic games and an algorithm to find minimax cycle means in directed graphs. USSR Comput. Math. Math. Phys. 28 5 (1988) 85-91
21. Hoffman A.J., and Karp R.M. On nonterminating stochastic games. Management Sci. 12 5 (1966) 359-370
22. Kalai G. A subexponential randomized simplex algorithm. 24th ACM STOC (1992) 475-482
23. L. Khachiyan, Private communication, DIMACS, April 2004.
24. L. Khachiyan, V. Gurvich, J. Zhao, Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction, RUTCOR Research Report RRR 31-2005, RUTCOR, Rutgers Center of Operations Research, October 2005.
25. Ludwig W. A subexponential randomized algorithm for the simple stochastic game problem. Inform. and Comput. 117 (1995) 151-155
26. Matoušek J., Sharir M., and Welzl M. A subexponential bound for linear programming. Eighth ACM Symposium on Computational Geometry (1992) 1-8
27. Matoušek J., Sharir M., and Welzl M. A subexponential bound for linear programming. Algorithmica 16 (1996) 498-516
28. Moulin H. Extensions of two person zero sum games. J. Math. Anal. Appl. 55 (1976) 490-508
29. Moulin H. Prolongements des jeux à deux joueurs de somme nulle. Bull. Soc. Math. France 45 (1976)
30. Pisaruk N. Mean cost cyclical games. Math. Oper. Res. 24 4 (1999) 817-828
31. A. Puri, Theory of hybrid systems and discrete events systems. Ph.D. Thesis, EECS University of Berkeley, 1995.
32. O. Svensson, S. Vorobyov, LP-polytopes for mean payoff games, RUTCOR Research Report RRR 34-2005, RUTCOR, Rutgers Center of Operations Research, October 2005 〈http://rutcor.rutgers.edu/∼rrr〉. See also: Linear programming polytope and algorithm for mean payoff games. Proc. 2nd Intern. Conference on Algorithmic Aspects in Information and Management (AAIM'06), Springer Lecture Notes in Computer Science, 2006, vol. 4041, pp. 64-78.
33. O. Svensson, S. Vorobyov, A subexponential algorithm for a subclass of P-matrix generalized linear complementarity problems, Technical Report DIMACS-2005-20, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, June 2005. See also: Linear complementarity and P-matrices for stochastic Games, Proc. 6th Intern. Andrei Ershov Memorial Conference "Perspectives of System Informatics" (PSI'06), 2006, Springer, Lecture Notes in Computer Science, to appear.
34. J. Vöge, M. Jurdziński, A discrete strategy improvement algorithm for solving parity games, in: E.A. Emerson, A.P. Sistla (Eds.), CAV'00: Computer-Aided Verification, Lecture Notes in Computer Science, vol. 1855, Springer, Berlin, 2000, pp. 202-215.
35. Williamson Hoke K. Completely unimodal numberings of a simple polytope. Discrete Appl. Math. 20 (1988) 69-81
36. J. Zhao, V. Gurvich, L. Khachiyan, Extending Dijkstra's algorithm to shortest paths with blocks, Technical Report DIMACS-2005-04, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ, February 2005 〈http://dimacs.rutgers.edu/TechnicalReports/〉.
37. Zwick U., and Paterson M. The complexity of mean payoff games on graphs. Theoret. Comput. Sci. 158 (1996) 343-359
38. D. Andersson, S. Vorobyov. Fast algorithms for monotonic discounted linear programs with two variables per inequality, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK, May 2006, preprint NI06019-LAA.