K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.
LibreCat: https://research-explorer.ista.ac.at/record/3854
DOI: 10.1007/978-3-642-15375-4_20

J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies? ,” in Proceedings of GandALF 2010, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.
LibreCat: https://research-explorer.ista.ac.at/record/489
DOI: 10.4204/EPTCS.25.7

K. Chatterjee, T. A. Henzinger, and F. Horn, “Finitary winning in omega-regular games,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 1. ACM, 2009.
LibreCat: https://research-explorer.ista.ac.at/record/3870
DOI: 10.1145/1614431.1614432

K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.
LibreCat: https://research-explorer.ista.ac.at/record/4543
DOI: 10.1007/978-3-642-03816-7_4

K. Chatterjee, T. A. Henzinger, and F. Horn, Improved lower bounds for request-response and finitary Streett games. IST Austria, 2009.
LibreCat: https://research-explorer.ista.ac.at/record/5394
DOI: 10.15479/AT:IST-2009-0002