The Complexity of Mean Payoff Games on Graphs

Uri Zwick, Mike Paterson. The Complexity of Mean Payoff Games on Graphs. Theoretical Computer Science, 158(1&2):343-359, 1996. [doi]

@article{ZwickP96,
  title = {The Complexity of Mean Payoff Games on Graphs},
  author = {Uri Zwick and Mike Paterson},
  year = {1996},
  doi = {10.1016/0304-3975(95)00188-3},
  url = {http://dx.doi.org/10.1016/0304-3975(95)00188-3},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ZwickP96},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {158},
  number = {1&2},
  pages = {343-359},
}