Uri Zwick and Michael S. Paterson Dept. of Computer Science, Tel Aviv...  Home/Search
Context
Related
| cs.tau.ac.il/%7Ezw...ayoffCOCOON.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.tau.ac.il/~z...yonlinepapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the complexity of nding the values and optimal strategies of mean payo 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 payo games to the simple stochastic games studied by Condon. These games are also known to be in NP \ co-NP, but no polynomial or... (Update)
Similar documents (at the sentence level):
45.9%: The Complexity of Mean Payoff Games on Graphs - Zwick, Paterson (1996) (Correct)
Active bibliography (related documents): More All
0.5: On Nash-solvability in pure stationary strategies of finite.. - Boros, Gurvich (2001) (Correct)
0.3: A Randomized Subexponential Algorithm for Parity Games - Petersson, Vorobyov (2001) (Correct)
0.2: Algorithms for Sequential Decision Making - Littman (1996) (Correct)
Similar documents based on text: More All
0.3: Deciding the Winner in Parity Games Is in UP. . . - Jurdzinski (1998) (Correct)
0.2: Optimal Carry Save Networks - Paterson, Pippenger, Zwick (Correct)
0.2: Shrinkage of de Morgan formulae under restriction - Paterson, Zwick (1993) (Correct)
BibTeX entry: (Update)
@misc{ and-complexity,
author = "Uri Zwick And",
title = "The Complexity of Mean Payo Games",
url = "citeseer.ist.psu.edu/673162.html" }
Citations (may not include all citations):3972 Introduction to algorithms (context) - Cormen, Leiserson et al. - 1990
102 A characterization of the minimum cycle mean in a digraph (context) - Karp - 1978
79 Stochastic games (context) - Shapley - 1953
72 An optimal on-line algorithm for metrical task system (context) - Borodin, Linial et al. - 1992
52 Information and Computation (context) - Condon, of - 1992
13 A subexponential randomized algorithm for the simple stochas.. (context) - Ludwig - 1995
9 Tighter lower bounds on the exact complexity of string match.. - Cole, Hariharan et al. - 1995
7 Surveys in game theory and related topics (context) - Peters, Vrieze - 1987
7 Every prime has a succinct certi cate (context) - Pratt - 1975
5 Positional strategies for mean payo games (context) - Ehrenfeucht, Mycielski - 1979
4 Cyclical games with prohibitions (context) - Karzanov, Lebedev - 1993
3 Cyclic games and an algorithm to nd minimax cycle means in d.. (context) - Gurvich, Karzanov et al. - 1988
Documents on the same site (http://www.cs.tau.ac.il/~zwick/my-online-papers.html): More
Which Patterns Are Hard to Find? - Cole, Hariharan, Paterson, Zwick (Correct)
Which Formulae Shrink under Random Restrictions? - Chockler, Zwick (Correct)
On the number of ANDs versus the number of ORs in monotone Boolean .. - Zwick (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC