{"intvolume":"      6638","conference":{"name":"LATA: Language and Automata Theory and Applications","end_date":"2011-05-31","start_date":"2011-05-26","location":"Tarragona, Spain"},"date_created":"2018-12-11T12:02:52Z","date_updated":"2021-01-12T07:42:54Z","language":[{"iso":"eng"}],"title":"The complexity of request-response games","volume":6638,"year":"2011","quality_controlled":"1","oa_version":"None","scopus_import":1,"publist_id":"3258","doi":"10.1007/978-3-642-21254-3_17","alternative_title":["LNCS"],"citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, &#38; C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">https://doi.org/10.1007/978-3-642-21254-3_17</a>","ista":"Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.","mla":"Chatterjee, Krishnendu, et al. <i>The Complexity of Request-Response Games</i>. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">10.1007/978-3-642-21254-3_17</a>.","ieee":"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.","ama":"Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:<a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">10.1007/978-3-642-21254-3_17</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21254-3_17\">https://doi.org/10.1007/978-3-642-21254-3_17</a>."},"month":"01","publication_status":"published","date_published":"2011-01-01T00:00:00Z","abstract":[{"text":"We consider two-player graph games whose objectives are request-response condition, i.e conjunctions of conditions of the form \"if a state with property Rq is visited, then later a state with property Rp is visited\". The winner of such games can be decided in EXPTIME and the problem is known to be NP-hard. In this paper, we close this gap by showing that this problem is, in fact, EXPTIME-complete. We show that the problem becomes PSPACE-complete if we only consider games played on DAGs, and NP-complete or PTIME-complete if there is only one player (depending on whether he wants to enforce or spoil the request-response condition). We also present near-optimal bounds on the memory needed to design winning strategies for each player, in each case.","lang":"eng"}],"status":"public","_id":"3357","editor":[{"first_name":"Adrian-Horia","full_name":"Dediu, Adrian-Horia","last_name":"Dediu"},{"first_name":"Shunsuke","last_name":"Inenaga","full_name":"Inenaga, Shunsuke"},{"first_name":"Carlos","last_name":"Martín-Vide","full_name":"Martín-Vide, Carlos"}],"day":"01","page":"227 - 237","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"conference","publisher":"Springer","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Horn, Florian","last_name":"Horn","first_name":"Florian","id":"37327ACE-F248-11E8-B48F-1D18A9856A87"}]}