Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Goeminne, Aline"'
Autor:
Goeminne, Aline, Monmege, Benjamin
We study multi-strategies in multiplayer reachability games played on finite graphs. A multi-strategy prescribes a set of possible actions, instead of a single action as usual strategies: it represents a set of all strategies that are consistent with
Externí odkaz:
http://arxiv.org/abs/2411.13296
Autor:
Brihaye, Thomas, Goeminne, Aline
We study two-player multi-weighted reachability games played on a finite directed graph, where an agent, called P1, has several quantitative reachability objectives that he wants to optimize against an antagonistic environment, called P2. In this set
Externí odkaz:
http://arxiv.org/abs/2308.09625
Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, measured as a cost depending on the number of players using the same li
Externí odkaz:
http://arxiv.org/abs/2207.01537
Autor:
Brihaye, Thomas, Goeminne, Aline
We study multiplayer turn-based timed games with reachability objectives. In particular, we are interested in the notion of subgame perfect equilibrium (SPE). We prove that deciding the constrained existence of an SPE in this setting is EXPTIME-compl
Externí odkaz:
http://arxiv.org/abs/2006.10491
We study multiplayer reachability games played on a finite directed graph equipped with target sets, one for each player. In those reachability games, it is known that there always exists a Nash equilibrium (NE) and a subgame perfect equilibrium (SPE
Externí odkaz:
http://arxiv.org/abs/1907.05481
Autor:
Brihaye, Thomas, Bruyère, Véronique, Goeminne, Aline, Raskin, Jean-François, Bogaard, Marie van den
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 4 (November 5, 2020) lmcs:5966
We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium (NE), we fo
Externí odkaz:
http://arxiv.org/abs/1905.00784
Publikováno v:
EPTCS 277, 2018, pp. 16-29
We study multiplayer turn-based games played on a finite directed graph such that each player aims at satisfying an omega-regular Boolean objective. Instead of the well-known notions of Nash equilibrium (NE) and subgame perfect equilibrium (SPE), we
Externí odkaz:
http://arxiv.org/abs/1809.03888
We study multiplayer turn-based games played on a finite directed graph such that each player aims at satisfying an omega-regular Boolean objective. Instead of the well-known notions of Nash equilibrium (NE) and subgame perfect equilibrium (SPE), we
Externí odkaz:
http://arxiv.org/abs/1806.05544
Publikováno v:
In Journal of Computer and System Sciences August 2021 119:211-230
Publikováno v:
In Information and Computation June 2021 278