Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Finite-Memory determinacy"'
Publikováno v:
TheoretiCS, Volume 2 (January 16, 2023) theoretics:9608
We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $\omega$-regular objectives, due to its relation to many natural problem
Externí odkaz:
http://arxiv.org/abs/2110.01276
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (December 1, 2023) lmcs:9201
We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-making in presence of an antagonistic opponent in a random environment. In this setting, an important question is the one of strategy complexity: what kinds of
Externí odkaz:
http://arxiv.org/abs/2102.10104
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-making in presence of an antagonistic opponent in a random environment. In this setting, an important question is the one of strategy complexity: what kinds of
Externí odkaz:
https://doaj.org/article/95a2799723e64aa5b931b8730bb0ee4e
We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM strategies suffic
Externí odkaz:
http://arxiv.org/abs/1808.05791
Publikováno v:
TheoretiCS, Vol Volume 2 (2023)
We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $\omega$-regular objectives, due to its relation to many natural problem
Externí odkaz:
https://doaj.org/article/d6f84a6ab3a445f0a877ca55e6453466
Autor:
Roux, Stéphane Le, Pauly, Arno
Publikováno v:
EPTCS 218, 2016, pp. 27-40
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding class of mu
Externí odkaz:
http://arxiv.org/abs/1607.03356
Autor:
Le Roux, Stéphane, Pauly, Arno
Publikováno v:
In Information and Computation August 2018 261 Part 4:676-694
Publikováno v:
STACS'22
STACS'22, Mar 2022, Online, France. ⟨10.4230/LIPIcs.STACS.2022.16⟩
STACS'22, Mar 2022, Online, France. ⟨10.4230/LIPIcs.STACS.2022.16⟩
We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $\omega$-regular objectives, due to its relation to many natural problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33b16948c417ec29c73a391f19750f8b
https://doi.org/10.46298/theoretics.23.1
https://doi.org/10.46298/theoretics.23.1
Autor:
Stéphane Le Roux, Arno Pauly
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 218, Iss Proc. SR 2016, Pp 27-40 (2016)
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding class of mu
Externí odkaz:
https://doaj.org/article/30edca1b54a74b84871555ace130e033