{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:07:40Z","timestamp":1742944060017,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_5","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T18:43:34Z","timestamp":1472928214000},"page":"52-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deciding Maxmin Reachability in Half-Blind Stochastic Games"],"prefix":"10.1007","author":[{"given":"Edon","family":"Kelmendi","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Gimbert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-07141-5_213","volume-title":"Gl-4.Jahrestagung:","author":"A Bertoni","year":"1975","unstructured":"Bertoni, A.: The solution of problems relative to probabilistic automata in the frame of the formal languages theory. In: Siefkes, D. (ed.) Gl-4.Jahrestagung: LNCS, vol. 26, pp. 107\u2013112. Springer, Heidelberg (1975)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-04081-8_16","volume-title":"CONCUR 2009 - Concurrency Theory","author":"R Chadha","year":"2009","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Power of randomization in automata on infinite strings. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 229\u2013243. Springer, Heidelberg (2009)"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/2579821","volume":"15","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Doyen, L.: Partial-observation stochastic games: how to win when belief fails. ACM Trans. Comput. Logic (TOCL) 15(2), 16 (2014)","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-54830-7_16","volume-title":"Foundations of Software Science and Computation Structures","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 (ETAPS). LNCS, vol. 8412, pp. 242\u2013257. Springer, Heidelberg (2014)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11590156_1","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"K Chatterjee","year":"2005","unstructured":"Chatterjee, K., Henzinger, T.A.: Semiperfect-information games. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 1\u201318. Springer, Heidelberg (2005)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Tracol, M.: Decidable problems for probabilistic automata on infinite words. In: 2012 27th Annual IEEE Symposium on Logic in Computer Science (LICS), vol. 2, pp. 185\u2013194. IEEE (2012)","DOI":"10.1109\/LICS.2012.29"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-02930-1_12","volume-title":"Automata, Languages and Programming","author":"T Colcombet","year":"2009","unstructured":"Colcombet, T.: The theory of stabilisation monoids and regular cost functions. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 139\u2013150. Springer, Heidelberg (2009)"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.2168\/LMCS-9(3:3)2013","volume":"9","author":"T Colcombet","year":"2013","unstructured":"Colcombet, T.: Regular cost functions, part I: logic and algebra overwords. Logical Methods Comput. Sci. 9(3), 47 (2013)","journal-title":"Logical Methods Comput. Sci."},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2007.07.008","volume":"386","author":"L Alfaro de","year":"2007","unstructured":"de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. Theor. Comput. Sci. 386(3), 188\u2013217 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR10","unstructured":"Fijalkow, N.: Profinite techniques for probabilistic automata and the optimality of the markov monoid algorithm. CoRR, abs\/1501.02997 (2015)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Fijalkow, N., Gimbert, H., Kelmendi, E., Oualhadj, Y: Deciding the value 1 problem for probabilistic leaktight automata. Logical Methods Comput. Sci. 11(2) (2015)","DOI":"10.2168\/LMCS-11(2:12)2015"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Fijalkow, N., Gimbert, H., Oualhadj, Y.: Deciding the value 1 problem for probabilistic leaktight automata. In: LICS, pp. 295\u2013304. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.40"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-14162-1_44","volume-title":"Automata, Languages and Programming","author":"H Gimbert","year":"2010","unstructured":"Gimbert, H., Oualhadj, Y.: Probabilistic automata on finite words: decidable and undecidable problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 527\u2013538. Springer, Heidelberg (2010)"},{"key":"5_CR14","unstructured":"Gimbert, H., Renault, J., Sorin, S., Venel, X., Zielonka, W.: On the values of repeated games with signals. CoRR, abs\/1406.4248 (2014)"},{"key":"5_CR15","unstructured":"Kelmendi, E., Gimbert, H.: Deciding maxmin reachability in half-blind stochastic games. CoRR, abs\/1605.07753 (2016). \n                      http:\/\/arxiv.org\/abs\/1605.07753"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/S0019-9958(66)90092-1","volume":"9","author":"A Paz","year":"1966","unstructured":"Paz, A.: Some aspects of probabilistic automata. Inf. Control 9(1), 26\u201360 (1966)","journal-title":"Inf. Control"},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"MO Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Inf. Control 6(3), 230\u2013245 (1963)","journal-title":"Inf. Control"},{"issue":"3\u20134","key":"5_CR18","first-page":"277","volume":"28","author":"I Simon","year":"1994","unstructured":"Simon, I.: On semigroups of matrices over the tropical semiring. ITA 28(3\u20134), 277\u2013294 (1994)","journal-title":"ITA"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:01:58Z","timestamp":1558314118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Liverpool","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}