Games Where You Can Play Optimally with Arena-Independent Finite Memory

For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller synthesis, which can be rephrased through the game-theoretic metaphor as the quest for a winning strategy of the system in...

Celý popis

Podrobná bibliografie

Vydáno v:	Logical methods in computer science Ročník 18, Issue 1
Hlavní autoři:	Bouyer, Patricia, Roux, Stéphane Le, Oualhadj, Youssouf, Randour, Mickael, Vandenhove, Pierre
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science Association 17.01.2022 Logical Methods in Computer Science e.V
Témata:	Computer Science computer science - computer science and game theory computer science - formal languages and automata theory computer science - logic in computer science Computer Science and Game Theory Logic in Computer Science
ISSN:	1860-5974, 1860-5974
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!