Abstract
This paper surveys recent works about the notion of universal graphs. They were introduced in the context of parity games for understanding the recent quasipolynomial time algorithms, but they are defined for arbitrary objectives yielding a new approach for constructing efficient algorithms for solving different classes of games.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A closely related solution was given in [14] by giving syntactic properties implying that a non-deterministic automaton is good-for-small-games and showing that the automaton constructed in Lehtinen’s algorithm has this property.
References
Bojańczyk, M., Czerwiński, W.: An automata toolbox, February 2018. https://www.mimuw.edu.pl/~bojan/papers/toolbox-reduced-feb6.pdf
Calude, C.S., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: STOC, pp. 252–263 (2017). https://doi.org/10.1145/3055399.3055409
Colcombet, T., Fijalkow, N.: Parity games and universal graphs. CoRR abs/1810.05106 (2018)
Colcombet, T., Fijalkow, N.: Universal graphs and good for games automata: new tools for infinite duration games. In: FoSSaCS, pp. 1–26 (2019). https://doi.org/10.1007/978-3-030-17127-8_1
Czerwiński, W., Daviaud, L., Fijalkow, N., Jurdziński, M., Lazić, R., Parys, P.: Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games. CoRR abs/1807.10546 (2018)
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–121 (2017)
Fijalkow, N.: An optimal value iteration algorithm for parity games. CoRR abs/1801.09618 (2018)
Fijalkow, N., Gawrychowski, P., Ohlmann, P.: The complexity of mean payoff games using universal graphs. CoRR abs/1812.07072 (2018)
Jurdziński, M., Lazić, R.: Succinct progress measures for solving parity games. In: LICS, pp. 1–9 (2017)
Jurdziński, M., Morvan, R.: A universal attractor decomposition algorithm for parity games. CoRR abs/2001.04333 (2020)
Lehtinen, K.: A modal-\(\mu \) perspective on solving parity games in quasi-polynomial time. In: LICS, pp. 639–648 (2018)
Lehtinen, K., Schewe, S., Wojtczak, D.: Improving the complexity of Parys’ recursive algorithm. CoRR abs/1904.11810 (2019)
Parys, P.: Parity games: Zielonka’s algorithm in quasi-polynomial time. In: MFCS, pp. 10:1–10:13 (2019). https://doi.org/10.4230/LIPIcs.MFCS.2019.10
Parys, P.: Parity games: another view on Lehtinen’s algorithm. In: CSL, pp. 32:1–32:15 (2020). https://doi.org/10.4230/LIPIcs.CSL.2020.32
Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1–2), 135–183 (1998). https://doi.org/10.1016/S0304-3975(98)00009-7
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 IFIP International Federation for Information Processing
About this paper
Cite this paper
Fijalkow, N. (2020). The Theory of Universal Graphs for Games: Past and Future. In: Petrişan, D., Rot, J. (eds) Coalgebraic Methods in Computer Science. CMCS 2020. Lecture Notes in Computer Science(), vol 12094. Springer, Cham. https://doi.org/10.1007/978-3-030-57201-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-57201-3_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-57200-6
Online ISBN: 978-3-030-57201-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
