References

1. Alessandro Bianco, Marco Faella, Fabio Mogavero & Aniello Murano (2011): Exploring the boundary of half-positionality. Ann. Math. Artif. Intell. 62(1-2), pp. 55–77. Available at http://dx.doi.org/10.1007/s10472-011-9250-1.
2. Henrik Björklund, Sven Sandberg & Sergei G. Vorobyov (2004): Memoryless determinacy of parity and mean payoff games: a simple proof. Theor. Comput. Sci. 310(1-3), pp. 365–378. Available at http://dx.doi.org/10.1016/S0304-3975(03)00427-4.
3. Krishnendu Chatterjee & Laurent Doyen (2012): Energy parity games. Theoretical Computer Science 458(0), pp. 49 – 60, doi:10.1016/j.tcs.2012.07.038. Available at http://www.sciencedirect.com/science/article/pii/S0304397512007475.
4. A. Ehrenfeucht & J. Mycielski (1979): Positional strategies for mean payoff games. International Journal of Game Theory 8(2), pp. 109–113. Available at http://dx.doi.org/10.1007/BF01768705.
5. Hugo Gimbert & Wieslaw Zielonka (2005): Games Where You Can Play Optimally Without Any Memory. In: CONCUR, pp. 428–442. Available at http://dx.doi.org/10.1007/11539452_33.
6. Eryk Kopczynski (2006): Half-Positional Determinacy of Infinite Games. In: ICALP (2), pp. 336–347. Available at http://dx.doi.org/10.1007/11787006_29.
7. Michael Sipser (1997): Introduction to the theory of computation. PWS Publishing Company.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org