@inproceedings{e2f5954effa24f1ba2266fcf0de2589a,
title = "The complexity of mean payoff games",
abstract = "We study the complexity of finding the values and optimal strategies of mean payoff games, a family of perfect information games introduced by Ehrenfeucht and Mycielski. We describe a pseudopolynomial 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.",
author = "Uri Zwick and Paterson, {Michael S.}",
note = "Publisher Copyright: {\textcopyright} 1995, Springer-Verlag. All Rights Reserved.; 1st Annual International Computing and Combinatorics Conference, COCOON 1995 ; Conference date: 24-08-1995 Through 26-08-1995",
year = "1995",
doi = "10.1007/BFb0030814",
language = "אנגלית",
isbn = "354060216X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--10",
editor = "Ding-Zhu Du and Ming Li and Ding-Zhu Du",
booktitle = "Computing and Combinatorics - 1st Annual International Conference, COCOON 1995, Proceedings",
address = "גרמניה",
}