HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-03232352
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, May 21, 2021 - 2:57:59 PM
Last modification on : Tuesday, January 4, 2022 - 6:17:22 AM
Long-term archiving on: : Sunday, August 22, 2021 - 6:49:25 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2023-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

28