52 citations · 149 across the 34 of their papers we have counts for
21 papers · 1 filter
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…
Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
In this paper, we deepen the study of two-player Stackelberg games played on graphs in which Player announces a strategy and Player , having several objectives, responds rat…
Valuing the Electricity Produced Locally in Renewable Energy Communities through Noncooperative Resources Scheduling Games
Louise Sadoine, Zacharie De Grève, Thomas Brihaye
We propose two market designs for the optimal day-ahead scheduling of energy exchanges within renewable energy communities. The first one implements a cooperative demand side manag…
Adversarial Formal Semantics of Attack Trees and Related Problems
Thomas Brihaye, Sophie Pinchinat, Alexandre Terefenko
Security is a subject of increasing attention in our actual society in order to protect critical resources from information disclosure, theft or damage. The informal model of attac…
One-Clock Priced Timed Games with Negative Weights
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +2
Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the cost of spending time in a st…
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…
Dynamics on Games: Simulation-Based Techniques and Applications to Routing
Thomas Brihaye, Gilles Geeraerts, Marion Hallet +2
We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theo…
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…
Dynamics and Coalitions in Sequential Games
Thomas Brihaye, Gilles Geeraerts, Marion Hallet +1
We consider N-player non-zero sum games played on finite trees (i.e., sequential games), in which the players have the right to repeatedly update their respective strategies (for i…
Efficient Energy Distribution in a Smart Grid using Multi-Player Games
Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts +2
Algorithms and models based on game theory have nowadays become prominent techniques for the design of digital controllers for critical systems. Indeed, such techniques enable auto…
Simple Priced Timed Games Are Not That Simple
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +2
Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a st…
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability
Thomas Brihaye, Véronique Bruyère, Noémie Meunier +1
We study -player turn-based games played on a finite directed graph. For each play, the players have to pay a cost that they want to minimize. Instead of the well-known notion o…
Quantitative Games under Failures
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +3
We study a generalisation of sabotage games, a model of dynamic network games introduced by van Benthem. The original definition of the game is inherently finite and therefore does…
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +1
Quantitative games are two-player zero-sum games played on directed weighted graphs. Total-payoff games (that can be seen as a refinement of the well-studied mean-payoff games) are…
Adding Negative Prices to Priced Timed Games
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna +3
Priced timed games (PTGs) are two-player zero-sum games played on the infinite graph of configurations of priced timed automata where two players take turns to choose transitions i…
Multiplayer Cost Games with Simple Nash Equilibria
Thomas Brihaye, Julie De Pril, Sven Schewe
Multiplayer games with selfish agents naturally occur in the design of distributed and embedded systems. As the goals of selfish agents are usually neither equivalent nor antagonis…
On Equilibria in Quantitative Games with Reachability/Safety Objectives
Thomas Brihaye, Véronique Bruyère, Julie De Pril
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with both reachability and safety objectives. In this framework a player with…
On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
Thomas Brihaye, Véronique Bruyère, Julie De Pril +1
We study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In such games, each player aims at reaching his own goal set o…