%0 Conference Proceedings
%T The Theory of Universal Graphs for Games: Past and Future
%+ Laboratoire Bordelais de Recherche en Informatique (LaBRI)
%+ The Alan Turing Institute
%A Fijalkow, Nathanaël
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 15th International Workshop on Coalgebraic Methods in Computer Science (CMCS)
%C Dublin, Ireland
%Y Daniela Petrişan
%Y Jurriaan Rot
%I Springer International Publishing
%3 Coalgebraic Methods in Computer Science
%V LNCS-12094
%P 1-10
%8 2020-04-25
%D 2020
%R 10.1007/978-3-030-57201-3_1
%K Games
%K Parity games
%K Universal graphs
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.3
%2 https://inria.hal.science/hal-03232352/document
%2 https://inria.hal.science/hal-03232352/file/493577_1_En_1_Chapter.pdf
%L hal-03232352
%U https://inria.hal.science/hal-03232352
%~ CNRS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-3
%~ IFIP-CMCS
%~ TEST-HALCNRS
%~ IFIP-LNCS-12094