The design and control of autonomous systems that operate in uncertain or adversarial
environments can be facilitated by formal modeling and analysis. Probabilistic model …

Automated verification techniques for stochastic games allow formal reasoning about
systems that feature competitive or collaborative behaviour among rational agents in …

Game-theoretic concepts have been extensively studied in economics to provide insight into
competitive behaviour and strategic decision making. As computing systems increasingly …

In this survey, we propose a comprehensive introduction to game theory applied to computer-
aided synthesis. We study multi-player turn-based infinite-duration games played on a finite …

In this paper, we provide an effective characterization of all the subgame-perfect equilibria in
infinite duration games played on finite graphs with mean-payoff objectives. To this end, we …

We study a natural problem about rational behaviors in multiplayer non-zero-sum sequential
infinite duration games played on graphs: rational verification, that consists in deciding …

We present novel techniques for neuro-symbolic concurrent stochastic games, a recently
proposed modelling formalism to represent a set of probabilistic agents operating in a …

Concurrent stochastic games (CSGs) are an ideal formalism for modelling probabilistic
systems that feature multiple players or components with distinct objectives making …

We study the framework of two-player Stackelberg games played on graphs in which Player
0 announces a strategy and Player 1 responds rationally with a strategy that is an optimal …

We establish that the subgame perfect equilibrium (SPE) threshold problem for mean-payoff
games is NP-complete. While the SPE threshold problem was recently shown to be …