Zobrazeno 1 - 10
of 139
pro vyhledávání: '"Patricia Bouyer"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies. In this paper, we characterize objectives recognizable by deterministic B\"uchi automata (a
Externí odkaz:
https://doaj.org/article/454507a3c3354b06bf46c7c822f9e07f
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
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
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)
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
Externí odkaz:
https://doaj.org/article/c49da1dd2b4c42db88563c7cb050ce6b
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 1 (2021)
Broadcast networks allow one to model networks of identical nodes communicating through message broadcasts. Their parameterized verification aims at proving a property holds for any number of nodes, under any communication topology, and on all possib
Externí odkaz:
https://doaj.org/article/01181bc2d4234d50a2370367fb88ec14
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 277, Iss Proc. GandALF 2018, Pp 250-264 (2018)
In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a
Externí odkaz:
https://doaj.org/article/3cae925e086c4b859920046a2abb280f
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 226, Iss Proc. GandALF 2016, Pp 61-75 (2016)
We study the existence of mixed-strategy equilibria in concurrent games played on graphs. While existence is guaranteed with safety objectives for each player, Nash equilibria need not exist when players are given arbitrary terminal-reward objectives
Externí odkaz:
https://doaj.org/article/2eb444f634ca4f3188b602edd57faab4
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 193, Iss Proc. GandALF 2015, Pp 1-15 (2015)
Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the objective is t
Externí odkaz:
https://doaj.org/article/a87a5c255e5a463ba2d933f1030f3835
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 49-55 (2014)
We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. The
Externí odkaz:
https://doaj.org/article/f90474f694414c3a9f59367d3cb0b30c
Publikováno v:
Logical Methods in Computer Science, Vol Volume 11, Issue 2 (2015)
We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a two-player
Externí odkaz:
https://doaj.org/article/85eee5656e9e4062b9e3a5ec062b2097