We define a notion of morphisms between open games, exploiting a surprising connection
between lenses in computer science and compositional game theory. This extends the …

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 …

Dynamic programming is a class of algorithms used to compute optimal control policies for
Markov decision processes. Dynamic programming is ubiquitous in control theory, and is …

We present the starting elements of a mathematical theory of policy advice and avoidability.
More specifically, we formalize a cluster of notions related to policy advice, such as policy …

We present a computer-checked generic implementation for solving finite-horizon sequential
decision problems. This is a wide class of problems, including inter-temporal optimizations …

In applied game theory the modelling of each player's intentions and motivations is a key
aspect. In classical game theory these are encoded in the payoff functions. In previous work …

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 …

It is a trivial observation that the emerging science of global systems relies essentially on
computer models. All science nowadays relies on computer models (for an interesting …