{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T09:49:42Z","timestamp":1790675382209,"version":"4.1.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce the notion of universal graphs as a tool for constructing\nalgorithms solving games of infinite duration such as parity games and mean\npayoff games. In the first part we develop the theory of universal graphs, with\ntwo goals: showing an equivalence and normalisation result between different\nrecently introduced related models, and constructing generic value iteration\nalgorithms for any positionally determined objective. In the second part we\ngive four applications: to parity games, to mean payoff games, to a disjunction\nbetween a parity and a mean payoff objective, and to disjunctions of several\nmean payoff objectives. For each of these four cases we construct algorithms\nachieving or improving over the best known time and space complexity.<\/jats:p>","DOI":"10.46298\/lmcs-18(3:29)2022","type":"journal-article","created":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T07:35:38Z","timestamp":1663572938000},"source":"Crossref","is-referenced-by-count":5,"title":["The Theory of Universal Graphs for Infinite Duration Games"],"prefix":"10.46298","volume":"Volume 18, Issue 3","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathana\u00ebl","family":"Fijalkow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Ohlmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2022,9,7]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/10012\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/10012\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:14Z","timestamp":1687292414000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/7715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(3:29)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2104.05262v6","asserted-by":"subject"},{"id-type":"arxiv","id":"2104.05262v5","asserted-by":"subject"},{"id-type":"arxiv","id":"2104.05262v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2104.05262v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2104.05262","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2104.05262","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,7]]},"article-number":"7715"}}