Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
The complexity of mean payoff games on graphs
Uri Zwick
*
, Mike Paterson
*
Corresponding author for this work
School of Computer Science
University of Warwick
Research output
:
Contribution to journal
›
Article
›
peer-review
389
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The complexity of mean payoff games on graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Mean-payoff Games
100%
Games on Graphs
100%
Pseudo-polynomial Time Algorithm
66%
Decision Problems
33%
Optimal Strategy
33%
Simple Stochastic Games
33%
Perfect Information Games
33%
Mycielski
33%
Polynomial Reduction
33%
Value Strategies
33%
Mathematics
Polynomial
100%
Polynomial Time
100%
Optimal Strategy
50%
Stochastic Game
50%
Computer Science
polynomial-time algorithm
100%
Decision Problem
50%
Optimal Strategy
50%
Perfect Information
50%
Biochemistry, Genetics and Molecular Biology
Solution and Solubility
100%