Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Brice, L��onard"'
We study the complexity of problems related to subgame-perfect equilibria (SPEs) in infinite duration non zero-sum multiplayer games played on finite graphs with parity objectives. We present new complexity results that close gaps in the literature.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a739eb9be61620b13038007c9a4d482
http://arxiv.org/abs/2107.07458
http://arxiv.org/abs/2107.07458
