{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:21:53Z","timestamp":1781893313471,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540499947","type":"print"},{"value":"9783540499954","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_21","type":"book-chapter","created":{"date-parts":[[2006,11,28]],"date-time":"2006-11-28T04:48:02Z","timestamp":1164689282000},"page":"212-223","source":"Crossref","is-referenced-by-count":28,"title":["Rational Behaviour and Strategy Construction in Infinite Multiplayer Games"],"prefix":"10.1007","author":[{"given":"Michael","family":"Ummels","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/LICS.2004.1319610","volume-title":"Proceedings of the 19th Annual Symposium on Logic in Computer Science, LICS 2004","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Games with secure equilibria. In: Proceedings of the 19th Annual Symposium on Logic in Computer Science, LICS 2004, pp. 160\u2013169. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30124-0_6","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Majumdar, R., Jurdzi\u0144ski, M.: On nash equilibria in stochastic games. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 26\u201340. Springer, Heidelberg (2004)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/SFCS.1991.185392","volume-title":"Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, FoCS 1991","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, FoCS 1991, pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification","author":"E.A. Emerson","year":"1993","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model-checking for fragments of \u03bc-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 385\u2013396. Springer, Heidelberg (1993)"},{"key":"21_CR5","series-title":"Annals of Mathematical Studies","first-page":"245","volume-title":"Contributions to the Theory of Games II","author":"D. Gale","year":"1953","unstructured":"Gale, D., Stewart, F.M.: Infinite games with perfect information. In: Contributions to the Theory of Games II. Annals of Mathematical Studies, vol.\u00a028, pp. 245\u2013266. Princeton University Press, Princeton (1953)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"21_CR7","series-title":"Annals of Mathematical Studies","first-page":"193","volume-title":"Contributions to the Theory of Games II","author":"H.W. Kuhn","year":"1953","unstructured":"Kuhn, H.W.: Extensive Games and the Problem of Information. In: Contributions to the Theory of Games II. Annals of Mathematical Studies, vol.\u00a028, pp. 193\u2013216. Princeton University Press, Princeton (1953)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Annals of Mathematics\u00a0102, 363\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0168-0072(90)90029-2","volume":"49","author":"D.A. Martin","year":"1990","unstructured":"Martin, D.A.: An extension of Borel determinacy. Annals of Pure and Applied Logic\u00a049(3), 279\u2013293 (1990)","journal-title":"Annals of Pure and Applied Logic"},{"key":"21_CR10","unstructured":"Mostowski, A.W.: Games with forbidden positions. Technical Report\u00a078, Instytut Matematyki, Uniwersytet Gda\u0144ski, Poland (1991)"},{"issue":"1-2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","volume":"141","author":"D.E. Muller","year":"1995","unstructured":"Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra. Theoretical Computer Science\u00a0141(1-2), 69\u2013107 (1995)","journal-title":"Theoretical Computer Science"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash Jr.","year":"1950","unstructured":"Nash Jr., J.F.: Equilibrium points in N-person games. Proceedings of the National Academy of Sciences of the United States of America\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"21_CR13","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1109\/FSCS.1990.89597","volume-title":"Proceedings of the 31st Annual Symposium on Foundations of Computer Science, FoCS 1990","author":"A. Pnueli","year":"1990","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, FoCS 1990, pp. 746\u2013757. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Automata on infinite objects and Church\u2019s problem. American Mathematical Society (1972)","DOI":"10.1090\/cbms\/013"},{"key":"21_CR16","first-page":"301","volume":"121","author":"R. Selten","year":"1965","unstructured":"Selten, R.: Spieltheoretische Behandlung eines Oligopolmodells mit Nachfragetr\u00e4gheit. Zeitschrift f\u00fcr die gesamte Staatswissenschaft\u00a0121, 301\u2013324, 667\u2013689 (1965)","journal-title":"Zeitschrift f\u00fcr die gesamte Staatswissenschaft"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS 95","author":"W. Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 1\u201313. Springer, Heidelberg (1995)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Ummels, M.: Rational behaviour and strategy construction in infinite multiplayer games. Master\u2019s thesis, RWTH Aachen, Germany (2005)","DOI":"10.1007\/11944836_21"},{"issue":"1-2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science\u00a0200(1-2), 135\u2013183 (1998)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:43Z","timestamp":1619507863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11944836_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}