activity
20152022
most citedThe selection monad as a CPS transformation

4 citations · 10 across the 6 of their papers we have counts for

collaborators
Showing cs.GTShow all

9 papers · 1 filter

cs.GT2019

The game semantics of game theory

Jules Hedges

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 Environment.…

cs.GT2018

Sequential games and nondeterministic selection functions

Joe Bolt, Jules Hedges, Philipp Zahn

This paper analyses Escardó and Oliva's generalisation of selection functions over a strong monad from a game-theoretic perspective. We focus on the case of the nondeterminism (fin…

cs.GT2018

Backward Induction for Repeated Games

Jules Hedges

We present a method of backward induction for computing approximate subgame perfect Nash equilibria of infinitely repeated games with discounted payoffs. This uses the selection mo…

cs.GT2018

The algebra of predicting agents

Joe Bolt, Jules Hedges, Viktor Winschel

The category of open games, which provides a strongly compositional foundation of economic game theory, is intermediate between symmetric monoidal and compact closed. More precisel…

cs.GT2017

Morphisms of open games

Jules Hedges

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 more intui…

cs.GT2016

Compositionality and String Diagrams for Game Theory

Jules Hedges, Evguenia Shprits, Viktor Winschel +1

We introduce string diagrams as a formal mathematical, graphical language to represent, compose, program and reason about games. The language is well established in quantum physics…