Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Roux, Stéphane le"'
We study two-player games on finite graphs. Turn-based games have many nice properties, but concurrent games are harder to tame: e.g. turn-based stochastic parity games have positional optimal strategies, whereas even basic concurrent reachability ga
Externí odkaz:
http://arxiv.org/abs/2311.14373
We investigate concurrent two-player win/lose stochastic games on finite graphs with prefix-independent objectives. We characterize subgame optimal strategies and use this characterization to show various memory transfer results: 1) For a given (pref
Externí odkaz:
http://arxiv.org/abs/2301.10697
We study two-player concurrent stochastic games on finite graphs, with B\"uchi and co-B\"uchi objectives. The goal of the first player is to maximize the probability of satisfying the given objective. Following Martin's determinacy theorem for Blackw
Externí odkaz:
http://arxiv.org/abs/2203.06966
We study two-player reachability games on finite graphs. At each state the interaction between the players is concurrent and there is a stochastic Nature. Players also play stochastically. The literature tells us that 1) Player B, who wants to avoid
Externí odkaz:
http://arxiv.org/abs/2110.14724
We study infinite two-player win/lose games $(A,B,W)$ where $A,B$ are finite and $W \subseteq (A \times B)^\omega$. At each round Player 1 and Player 2 concurrently choose one action in $A$ and $B$, respectively. Player 1 wins iff the generated seque
Externí odkaz:
http://arxiv.org/abs/2107.09945
In general, finite concurrent two-player reachability games are only determined in a weak sense: the supremum probability to win can be approached via stochastic strategies, but cannot be realized. We introduce a class of concurrent games that are de
Externí odkaz:
http://arxiv.org/abs/2107.04081
Autor:
Bouyer, Patricia, Roux, Stéphane Le, Oualhadj, Youssouf, Randour, Mickael, Vandenhove, Pierre
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (January 17, 2022) lmcs:7329
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:
http://arxiv.org/abs/2001.03894
Autor:
Roux, Stéphane Le
Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simple such strategies can get. The answer may help with act
Externí odkaz:
http://arxiv.org/abs/1907.05128
Autor:
Alexopoulos, Nikolaos, Vasilomanolakis, Emmanouil, Roux, Stephane Le, Rowe, Steven, Mühlhäuser, Max
Sophisticated mass attacks, especially when exploiting zero-day vulnerabilities, have the potential to cause destructive damage to organizations and critical infrastructure. To timely detect and contain such attacks, collaboration among the defenders
Externí odkaz:
http://arxiv.org/abs/1905.03571
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