8 citations · 12 across the 5 of their papers we have counts for
8 papers
Permissive Equilibria in Multiplayer Reachability Games
Aline Goeminne, Benjamin Monmege
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 stra…
Multi-weighted Reachability Games and Their Application to Permissiveness
Thomas Brihaye, Aline Goeminne
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 t…
Non-Blind Strategies in Timed Network Congestion Games
Aline Goeminne, Nicolas Markey, Ocan Sankur
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, m…
On Subgame Perfect Equilibria in Turn-Based Reachability Timed Games
Thomas Brihaye, Aline Goeminne
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 decidin…
On Relevant Equilibria in Reachability Games
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +1
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…
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +2
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 poss…
Constrained Existence Problem for Weak Subgame Perfect Equilibria with -Regular Boolean Objectives
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +1
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 notio…
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives (full version)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +1
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 notio…