MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  The complexity of mean payoff games on graphs (1996) [27 citations — 1 self]

Download:
Download as a PDF | Download as a PS
by Uri Zwick, Mike Paterson
Theoretical Computer Science
http://www.math.tau.ac.il/~zwick/MPG.ps.gz
Add To MetaCart

Abstract:

We study the complexity of finding the values and optimal strategies of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan. We describe a pseudo-polynomial time algorithm for the solution of such games, the decision problem for which is in NP " co-NP. Finally, we describe a polynomial reduction from mean payoff games to the simple stochastic games studied by Condon. These games are also known to be in NP " co-NP, but no polynomial or pseudo-polynomial time algorithm is known for them.

Citations

5825 Introduction to Algorithms – Cormen, Leiserson, et al. - 2001
165 An optimal online algorithm for metrical task system – Borodin, Linial, et al. - 1992
142 A characterization of the minimum cycle mean in a digraph – Karp - 1978
88 The complexity of stochastic games – Condon - 1992
75 Selection and sorting with limited storage – Munro, Paterson - 1980
60 Every prime has a succinct certificate – Pratt - 1975
39 New scaling algorithms for the assignment and minimum cycle mean problems. Mathematical Programming 54 – Orlin, Ahuja - 1992
29 Faster parametric shortest path and minimum balance algorithms – Young, Tarjan, et al. - 1991
27 A subexponential randomized algorithm for the simple stochastic game problem – Ludwig - 1995
19 Positional strategies for mean payoff games – Ehrenfeutcht, Mycielski - 1979
18 Tighter lower bounds on the exact complexity of string matching – Cole, Hariharan, et al. - 1995
14 Cyclic games and an algorithm to find minimax cycle means in directed graphs – Gurvich, Karzanov, et al. - 1988
6 Complexity of path-forming games – Bodlaender - 1993
6 Cyclical games with prohibitions – Karzanov, Lebedev - 1993
5 Cycles in extensive form perfect information games – Alpern - 1991
5 Surveys in game theory and related topics, CWI Tract 39. Centrum voor Wiskunde en Informatica – Peters, Vrieze - 1987
4 On the complexity of the policy iteration algorithm for stochastic games – Melekopoglou, Condon - 1990
2 Prolongement des jeux a deux joueurs de somme nulle – Moulin - 1976
1 An O(n ) algorithm for the maximum cycle mean of an n \Theta n bivalent matrix – Butkovic, Cuninghame-Green - 1992
1 Undirected edge geography – Fraenkel, Scheinerman, et al. - 1993
1 Algorithms to solve some classes of network minimax problems and their applications – Lozovanu - 1991
1 Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games – Lozovanu - 1993
View or Download | Add to My Collection | Correct Errors