| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952153 | Theoretical Computer Science | 2017 | 4 Pages |
Abstract
We prove that to find optimal positional strategies for stochastic mean payoff games when the value of every state of the game is known, in general, is as hard as solving such games tout court. This answers a question posed by Daniel Andersson and Peter Bro Miltersen.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Marcello Mamino,