The Theory of Universal Graphs for Games: Past and Future - Coalgebraic Methods in Computer Science Access content directly
Conference Papers Year : 2020

The Theory of Universal Graphs for Games: Past and Future

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.
Fichier principal
Vignette du fichier
493577_1_En_1_Chapter.pdf (306.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03232352 , version 1 (21-05-2021)

Licence

Attribution

Identifiers

Cite

Nathanaël Fijalkow. The Theory of Universal Graphs for Games: Past and Future. 15th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2020, Dublin, Ireland. pp.1-10, ⟨10.1007/978-3-030-57201-3_1⟩. ⟨hal-03232352⟩
44 View
25 Download

Altmetric

Share

Gmail Facebook X LinkedIn More