{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:11:29Z","timestamp":1751688689079},"reference-count":13,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2024,3,1]]},"DOI":"10.1587\/transinf.2023fcp0003","type":"journal-article","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T22:25:13Z","timestamp":1709245513000},"page":"301-311","source":"Crossref","is-referenced-by-count":1,"title":["Non-Cooperative Rational Synthesis Problem on Stochastic Games for Positional Strategies"],"prefix":"10.1587","volume":"E107.D","author":[{"given":"So","family":"KOIDE","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}]},{"given":"Yoshiaki","family":"TAKATA","sequence":"additional","affiliation":[{"name":"School of Informatics, Kochi University of Technology"}]},{"given":"Hiroyuki","family":"SEKI","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] D. Fisman, O. Kupferman, and Y. Lustig, \u201cRational synthesis,\u201d 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2010), Lecture Notes in Computer Science, vol.6015, pp.190-204, Springer, 2010. 10.1007\/978-3-642-12002-2_16","DOI":"10.1007\/978-3-642-12002-2_16"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] O. Kupferman, G. Perelli, and M.Y. Vardi, \u201cSynthesis with rational environments,\u201d Ann. Math. Artif. Intell., vol.78, no.1, pp.3-20, 2016. 10.1007\/s10472-016-9508-8","DOI":"10.1007\/s10472-016-9508-8"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] W. Thomas, \u201cAutomata on infinite objects,\u201d Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, ed. J. van Leeuwen, pp.133-191, Elsevier and MIT Press, 1990. 10.1016\/b978-0-444-88074-1.50009-3","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] R. Bloem, K. Chatterjee, and B. Jobstmann, \u201cGraph games and reactive synthesis,\u201d Handbook of Model Checking, ed. E.M. Clarke, T.A. Henzinger, H. Veith, and R. Bloem, pp.921-962, Springer, 2018. 10.1007\/978-3-319-10575-8_27","DOI":"10.1007\/978-3-319-10575-8_27"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] M. Ummels and D. Wojtczak, \u201cThe complexity of Nash equilibria in stochastic multiplayer games,\u201d Log. Methods Comput. Sci., vol.7, no.3, 2011. 10.2168\/lmcs-7(3:20)2011","DOI":"10.2168\/LMCS-7(3:20)2011"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Ummels, Stochastic multiplayer games: theory and algorithms, Ph.D. thesis, RWTH Aachen University, 2011.","DOI":"10.5117\/9789085550402"},{"key":"7","unstructured":"[7] R. Condurache, E. Filiot, R. Gentilini, and J. Raskin, \u201cThe complexity of rational synthesis,\u201d 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), LIPIcs, vol.55, pp.121:1-121:15, 2016."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] A. Pnueli, \u201cThe temporal semantics of concurrent programs,\u201d Theor. Comput. Sci., vol.13, no.1, pp.45-60, 1981. 10.1016\/0304-3975(81)90110-9","DOI":"10.1016\/0304-3975(81)90110-9"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] E. Allender, P. B\u00fcrgisser, J. Kjeldgaard-Pedersen, and P.B. Miltersen, \u201cOn the complexity of numerical analysis,\u201d SIAM J. Comput., vol.38, no.5, pp.1987-2006, 2009. 10.1137\/070697926","DOI":"10.1137\/070697926"},{"key":"10","unstructured":"[10] S. Koide, \u201cNon-cooperative rational synthesis problem on stochastic games,\u201d Master's thesis, Graduate School of Informatics, Nagoya University, Jan. 2023."},{"key":"11","unstructured":"[11] C. Baier and J. Katoen, Principles of model checking, MIT Press, 2008."},{"key":"12","unstructured":"[12] L. de Alfaro, Formal verification of probabilistic systems, Ph.D. thesis, Stanford University, USA, 1997."},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] L.J. Stockmeyer, \u201cThe polynomial-time hierarchy,\u201d Theor. Comput. Sci., vol.3, no.1, pp.1-22, 1976. 10.1016\/0304-3975(76)90061-x","DOI":"10.1016\/0304-3975(76)90061-X"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E107.D\/3\/E107.D_2023FCP0003\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T04:24:04Z","timestamp":1709353444000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E107.D\/3\/E107.D_2023FCP0003\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,1]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2023fcp0003","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,1]]},"article-number":"2023FCP0003"}}