On the positional determinacy of edge-labeled games
The authors consider games with perfect information of possibly infinite duration played by two players. The mathematical structure used is a graph whose vertices are positions and edges specify possible moves. In the literature it is known that parity games admit positional determinacy: For any position one of the players can win the game using a positional strategy. This property holds if edges rather than vertices are labeled. In this paper it is shown that in this latter case the converse is also true.
scientific article; zbMATH DE number 5015098