{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:28:08Z","timestamp":1743118088804,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031757778"},{"type":"electronic","value":"9783031757785"}],"license":[{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75778-5_21","type":"book-chapter","created":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T12:09:07Z","timestamp":1731845347000},"page":"446-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Parity Games, Very Slowly"],"prefix":"10.1007","author":[{"given":"Tom","family":"van Dijk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,18]]},"reference":[{"key":"21_CR1","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"21_CR2","unstructured":"Benerecetti, M., Dell\u2019Erba, D., Mogavero, F., Schewe, S., Wojtczak, D.: Priority promotion with Parysian flair. CoRR arxiv:2105.01738 (2021)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Calude, C.S., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: STOC, pp. 252\u2013263. ACM (2017)","DOI":"10.1145\/3055399.3055409"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Fijalkow, N.: A reduction from parity games to simple stochastic games. In: GandALF. EPTCS, vol.\u00a054, pp. 74\u201386 (2011)","DOI":"10.4204\/EPTCS.54.6"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203\u2013224 (1992)","journal-title":"Inf. Comput."},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-319-96142-2_14","volume-title":"Computer Aided Verification","author":"T Dijk","year":"2018","unstructured":"Dijk, T.: Attracting tangles to solve parity games. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10982, pp. 198\u2013215. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96142-2_14"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-89960-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Dijk","year":"2018","unstructured":"Dijk, T.: Oink: an implementation and evaluation of modern parity game solvers. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 291\u2013308. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_16"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"van Dijk, T.: A parity game tale of two counters. In: GandALF. EPTCS, vol.\u00a0305, pp. 107\u2013122 (2019)","DOI":"10.4204\/EPTCS.305.8"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"van Dijk, T.: Avoiding distractions in parity games (2024)","DOI":"10.1007\/978-3-031-75380-0_19"},{"key":"21_CR10","unstructured":"van Dijk, T., Loho, G., Maat, M.T.: The worst-case complexity of symmetric strategy improvement. In: CSL. LIPIcs, vol.\u00a0288, pp. 24:1\u201324:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"van Dijk, T., Rubbens, B.: Simple fixpoint iteration to solve parity games. In: GandALF. EPTCS, vol.\u00a0305, pp. 123\u2013139 (2019)","DOI":"10.4204\/EPTCS.305.9"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/s10107-022-01848-x","volume":"199","author":"Y Disser","year":"2023","unstructured":"Disser, Y., Friedmann, O., Hopp, A.V.: An exponential lower bound for Zadeh\u2019s pivot rule. Math. Program. 199(1), 865\u2013936 (2023)","journal-title":"Math. Program."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: FOCS, pp. 368\u2013377. IEEE Computer Society (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Fearnley, J., Jain, S., Schewe, S., Stephan, F., Wojtczak, D.: An ordered approach to solving parity games in quasi polynomial time and quasi linear space. In: SPIN, pp. 112\u2013121. ACM (2017)","DOI":"10.1145\/3092282.3092286"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00453-007-0175-3","volume":"49","author":"N Halman","year":"2007","unstructured":"Halman, N.: Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems. Algorithmica 49(1), 37\u201350 (2007)","journal-title":"Algorithmica"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290\u2013301. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46541-3_24"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Jurdzinski, M., Lazic, R.: Succinct progress measures for solving parity games. In: LICS, pp.\u00a01\u20139. IEEE Computer Society (2017)","DOI":"10.1109\/LICS.2017.8005092"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Lehtinen, K., Parys, P., Schewe, S., Wojtczak, D.: A recursive approach to solving parity games in quasipolynomial time. Log. Methods Comput. Sci. 18(1) (2022)","DOI":"10.46298\/lmcs-18(1:8)2022"},{"key":"21_CR19","unstructured":"Parys, P.: Parity games: zielonka\u2019s algorithm in quasi-polynomial time. In: MFCS. LIPIcs, vol.\u00a0138, pp. 10:1\u201310:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"}],"container-title":["Lecture Notes in Computer Science","Principles of Verification: Cycling the Probabilistic Landscape"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75778-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T13:03:39Z","timestamp":1731848619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75778-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,18]]},"ISBN":["9783031757778","9783031757785"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75778-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,18]]},"assertion":[{"value":"18 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}