{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:25:51Z","timestamp":1743099951938,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319114385"},{"type":"electronic","value":"9783319114392"}],"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-319-11439-2_13","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:30:11Z","timestamp":1410744611000},"page":"163-175","source":"Crossref","is-referenced-by-count":3,"title":["Mean-Payoff Games with Partial-Observation"],"prefix":"10.1007","author":[{"given":"Paul","family":"Hunter","sequence":"first","affiliation":[]},{"given":"Guillermo A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Aminof, B., Rubin, S.: First cycle games. In: Mogavero, F., Murano, A., Vardi, M.Y. (eds.) SR. EPTCS, vol.\u00a0146, pp. 91\u201396 (2014)","DOI":"10.4204\/EPTCS.146.11"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-85361-9_27","volume-title":"CONCUR 2008 - Concurrency Theory","author":"D. Berwanger","year":"2008","unstructured":"Berwanger, D., Chatterjee, K., Doyen, L., Henzinger, T.A., Raje, S.: Strategy construction for parity games with imperfect information. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 325\u2013339. Springer, Heidelberg (2008)"},{"key":"13_CR3","unstructured":"Berwanger, D., Doyen, L.: On the power of imperfect information. In: FSTTCS, pp. 73\u201382 (2008)"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(03)00427-4","volume":"310","author":"H. Bj\u00f6rklund","year":"2004","unstructured":"Bj\u00f6rklund, H., Sandberg, S., Vorobyov, S.: Memoryless determinacy of parity and mean payoff games: a simple proof. TCS\u00a0310(1), 365\u2013378 (2004)","journal-title":"TCS"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L.: Partial-observation stochastic games: How to win when belief fails. In: LICS, pp. 175\u2013184. IEEE (2012)","DOI":"10.1109\/LICS.2012.28"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-15375-4_19","volume-title":"CONCUR 2010 - Concurrency Theory","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T.A., Rannou, P.: Mean-payoff automaton expressions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 269\u2013283. Springer, Heidelberg (2010)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"13_CR8","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: FSTTCS, pp. 505\u2013516 (2010)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-15205-4_22","volume-title":"Computer Science Logic","author":"A. Degorre","year":"2010","unstructured":"Degorre, A., Doyen, L., Gentilini, R., Raskin, J.-F., Toru\u0144czyk, S.: Energy and mean-payoff games with imperfect information. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 260\u2013274. Springer, Heidelberg (2010)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. International Journal of Game Theory\u00a08, 109\u2013113 (1979)","journal-title":"International Journal of Game Theory"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Hunter, P., P\u00e9rez, G.A., Raskin, J.-F.: Mean-payoff games with partial-observation (extended abstract). CoRR (2014)","DOI":"10.1007\/978-3-319-11439-2_13"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzi\u0144ski","year":"1998","unstructured":"Jurdzi\u0144ski, M.: Deciding the winner in parity games is in UP \u2229 coUP. IPL\u00a068(3), 119\u2013124 (1998)","journal-title":"IPL"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-94-015-9586-5_6","volume":"16","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesis with incomplete informatio. Advances in Temporal Logic\u00a016, 109\u2013127 (2000)","journal-title":"Advances in Temporal Logic"},{"issue":"18","key":"13_CR14","doi-asserted-by":"publisher","first-page":"6582","DOI":"10.1073\/pnas.85.18.6582","volume":"85","author":"D.A. Martin","year":"1988","unstructured":"Martin, D.A., Steel, J.R.: Projective determinacy. Proceedings of the National Academy of Sciences of the United States of America\u00a085(18), 6582 (1988)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"13_CR15","unstructured":"Papadimitriou, C.H.: Computational complexity. John Wiley and Sons Ltd. (2003)"},{"issue":"2","key":"13_CR16","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. Journal of Computer and System Sciences\u00a029(2), 274\u2013301 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. TCS\u00a0158(1), 343\u2013359 (1996)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11439-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:06:16Z","timestamp":1676891176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11439-2_13"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319114385","9783319114392"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11439-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}