We introduce a new foundation for game theory based on so-called open games. Unlike
existing approaches open games are fully compositional: games are built using algebraic …

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 …

In this paper, we design a potential game to investigate the interplay between sensors and
attackers in wireless remote estimation systems (RESs), where we consider both closed …

We investigate the existence of certain types of equilibria (Nash, ε-Nash, subgame perfect, ε-
subgame perfect) in infinite sequential games with real-valued payoff functions depending …

Nash equilibrium is a fundamental solution concept for modeling the behavior of self-
interested agents. We develop an algorithm to synthesize pure Nash equilibria in two-player …

We consider the degrees of non-computability (Weihrauch degrees) of finding winning
strategies (or more generally, Nash equilibria) in infinite sequential games with certain …

Nash equilibrium (NE) is a central concept in game theory. Here we prove formally a
published theorem on existence of an NE in two proof assistants, Coq and Isabelle: starting …

Subgame perfect equilibria are specific Nash equilibria in perfect information games in
extensive form. They are important because they relate to the rationality of the players. They …

We use a reformulation of compositional game theory to reunite game theory with game
semantics, by viewing an open game as the System and its choice of contexts as the …

We consider the degrees of non-computability (Weihrauch degrees) of finding winning
strategies (or more generally, Nash equilibria) in infinite sequential games with certain …