{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:01:05Z","timestamp":1751774465290,"version":"3.41.0"},"reference-count":5,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2025,7,1]]},"DOI":"10.1587\/transinf.2024edl8081","type":"journal-article","created":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T22:15:06Z","timestamp":1736374506000},"page":"849-852","source":"Crossref","is-referenced-by-count":0,"title":["Non-Cooperative Rational Synthesis Problem for Probabilistic Strategies"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"So","family":"KOIDE","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"TAKATA","sequence":"additional","affiliation":[{"name":"School of Informatics, Kochi University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"SEKI","sequence":"additional","affiliation":[{"name":"Graduate School of Informatics, Nagoya University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"doi-asserted-by":"crossref","unstructured":"[1] J. Canny, \u201cSome algebraic and geometric computations in PSPACE,\u201d 20th Annual ACM Symposium on Theory of Computing (ACMSTOC 1988), pp.460-469, 1988. 10.1145\/62212.62257","key":"1","DOI":"10.1145\/62212.62257"},{"doi-asserted-by":"crossref","unstructured":"[2] G.E. Colling, \u201cQuantifier elimination for real closed fields by cylindrical algebraic decomposition,\u201d H. Brakhage (eds), Automata Theory and Formal Languages, Lecture Notes in Computer Science, vol.33, pp.134-183, Springer, Berlin, Heidelberg, 1975. 10.1007\/3-540-07407-4_17","key":"2","DOI":"10.1007\/3-540-07407-4_17"},{"unstructured":"[3] R.D. Condurache, E. Filiot, R. Gentilini, and J.-F. Raskin, \u201cThe complexity of rational synthesis,\u201d 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), pp.121:1-121:15, 2016.","key":"3"},{"doi-asserted-by":"publisher","unstructured":"[4] S. Koide, Y. Takata, and H. Seki, \u201cNon-cooperative rational synthesis problem on stochastic games for positional strategies,\u201d IEICE Trans. Inf. & Syst., vol.E107-D, no.3, pp.301-311, March 2024. 10.1587\/transinf.2023FCP0003","key":"4","DOI":"10.1587\/transinf.2023FCP0003"},{"doi-asserted-by":"publisher","unstructured":"[5] M. Ummels and D. Wojtczak, \u201cThe complexity of Nash equilibria in stochastic multiplayer games,\u201d Logical Methods in Computer Science (LMCS), vol.7, no.3, 20, pp.1-45, 2011. 10.2168\/LMCS-7(3:20)2011","key":"5","DOI":"10.2168\/LMCS-7(3:20)2011"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/7\/E108.D_2024EDL8081\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T03:35:25Z","timestamp":1751686525000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/7\/E108.D_2024EDL8081\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,1]]},"references-count":5,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024edl8081","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2025,7,1]]},"article-number":"2024EDL8081"}}