On the Complexity of SPEs in Parity Games

DOI10.4230/LIPICS.CSL.2022.10arXiv2107.07458OpenAlexW3178639145MaRDI QIDQ6124939

Jean-François Raskin, Bogaard Marie van Den, Unnamed Author

Publication date: 10 April 2024

Full work available at URL: https://arxiv.org/abs/2107.07458

zbMATH Keywords

games on graphsparity objectivessubgame-perfect equilibria

Mathematics Subject Classification ID

Logic in computer science (03B70)

This page was built for publication: On the Complexity of SPEs in Parity Games