On the positional determinacy of edge-labeled games

  title={On the positional determinacy of edge-labeled games},
  author={Thomas Colcombet and Damian Niwinski},
  journal={Theor. Comput. Sci.},
It is well known that games with the parity winning condition admit positional determinacy : the winner has always a positional (memoryless) strategy. This property continues to hold if edges rather than vertices are labeled. We show that in this latter case the converse is also true. That is, a winning condition over arbitrary set of colors admits positional determinacy in all games if and only if it can be reduced to a parity condition with some finite number of priorities. 

From This Paper

Topics from this paper.
8 Citations
13 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 13 references

Mostowski . Games with forbidden positions

  • W. A.
  • 1993

Games with forbidden positions

  • A. W. Mostowski
  • Technical Report Technical Report 78, Instytut…
  • 1991
1 Excerpt

Tree automata

  • E. A. Emerson, C. S. Jutla
  • mu-calculus and determinacy. In Proceedings 32th…
  • 1991
2 Excerpts

Similar Papers

Loading similar papers…