{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:41:16Z","timestamp":1725795676185},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_10","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"110-121","source":"Crossref","is-referenced-by-count":6,"title":["Games with a Weak Adversary"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Doyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"ArXiv (2014), Full version \n                    \n                      http:\/\/arxiv.org\/abs\/1404.5453"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM\u00a049, 672\u2013713 (2002)","journal-title":"Journal of the ACM"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-78499-9_21","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Baier","year":"2008","unstructured":"Baier, C., Bertrand, N., Gr\u00f6\u00dfer, M.: On decision problems for probabilistic B\u00fcchi automata. In: Amadio, R.M. (ed.) FoSSaCS 2008. LNCS, vol.\u00a04962, pp. 287\u2013301. Springer, Heidelberg (2008)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. In: Proc. of LICS, pp. 319\u2013328 (2009)","DOI":"10.1109\/LICS.2009.31"},{"key":"10_CR5","unstructured":"Chatterjee, K.: Stochastic \u03c9-Regular Games. PhD thesis, UC Berkeley (2007)"},{"key":"10_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-16242-8_1","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L.: The complexity of partial-observation parity games. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 1\u201314. Springer, Heidelberg (2010)"},{"key":"#cr-split#-10_CR7.1","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L.: Partial-observation stochastic games: How to win when belief fails. In: Proc. of LICS 2012","DOI":"10.1109\/LICS.2012.28"},{"key":"#cr-split#-10_CR7.2","unstructured":"Journal version ACM ToCL, pp. 175-184. IEEE (2012)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-15155-2_23","volume-title":"Mathematical Foundations of Computer Science 2010","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Gimbert, H., Henzinger, T.A.: Randomness for free. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 246\u2013257. Springer, Heidelberg (2010)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games of incomplete information. Logical Methods in Computer Science 3(3:4) (2007)","DOI":"10.2168\/LMCS-3(3:4)2007"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-642-54830-7_16","volume-title":"FoSSaCS 2014","author":"K. Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L., Nain, S., Vardi, M.Y.: The complexity of partial-observation stochastic parity games with finite-memory strategies. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol.\u00a08412, pp. 242\u2013257. Springer, Heidelberg (2014)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-45220-1_11","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2003","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.A.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 100\u2013113. Springer, Heidelberg (2003)"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11730637_14","volume-title":"Hybrid Systems: Computation and Control","author":"M. Wulf De","year":"2006","unstructured":"De Wulf, M., Doyen, L., Raskin, J.-F.: A lattice theory for solving games of imperfect information. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol.\u00a03927, pp. 153\u2013168. Springer, Heidelberg (2006)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-15205-4_25","volume-title":"Computer Science Logic","author":"B. Finkbeiner","year":"2010","unstructured":"Finkbeiner, B., Schewe, S.: Coordination logic. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 305\u2013319. Springer, Heidelberg (2010)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0304-3975(99)00038-9","volume":"221","author":"T.A. Henzinger","year":"1999","unstructured":"Henzinger, T.A., Kopke, P.W.: Discrete-time control for rectangular hybrid automata. Theor. Comp. Science\u00a0221, 369\u2013392 (1999)","journal-title":"Theor. Comp. Science"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Kechris, A.: Classical Descriptive Set Theory. Springer (1995)","DOI":"10.1007\/978-1-4612-4190-4"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-48224-5_33","volume-title":"Automata, Languages and Programming","author":"P. Madhusudan","year":"2001","unstructured":"Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 396\u2013407. Springer, Heidelberg (2001)"},{"issue":"2","key":"10_CR17","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(2), 363\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-24597-1_29","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"S. Mohalik","year":"2003","unstructured":"Mohalik, S., Walukiewicz, I.: Distributed games. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 338\u2013351. Springer, Heidelberg (2003)"},{"key":"10_CR19","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Peterson, G.L., Reif, J.H.: Multiple-person alternation. In: FOCS, pp. 348\u2013363 (1979)","DOI":"10.1109\/SFCS.1979.25"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. of POPL, pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"issue":"1","key":"10_CR22","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"P.J. Ramadge","year":"1987","unstructured":"Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete-event processes. SIAM Journal of Control and Optimization\u00a025(1), 206\u2013230 (1987)","journal-title":"SIAM Journal of Control and Optimization"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-642-15375-4_35","volume-title":"CONCUR 2010 - Concurrency Theory","author":"R. Ramanujam","year":"2010","unstructured":"Ramanujam, R., Simon, S.: A communication based model for games of imperfect information. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 509\u2013523. Springer, Heidelberg (2010)"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: Universal games of incomplete information. In: Proc. of STOC, pp. 288\u2013308 (1979)","DOI":"10.1145\/800135.804422"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. JCSS\u00a029, 274\u2013301 (1984)","journal-title":"JCSS"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Reif, J.H., Peterson, G.L.: A dynamic logic of multiprocessing with incomplete information. In: Proc. of POPL, pp. 193\u2013202. ACM (1980)","DOI":"10.1145\/567446.567465"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Languages. Beyond Words, vol.\u00a03, ch. 7, pp. 389\u2013455. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_7"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:11:55Z","timestamp":1558908715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}