activity
20152017
most citedThe selection monad as a CPS transformation

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

collaborators

6 papers

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…

cs.GT2015

Higher-Order Decision Theory

Jules Hedges, Paulo Oliva, Evguenia Sprits +2

Classical decision theory models behaviour in terms of utility maximisation where utilities represent rational preference relations over outcomes. However, empirical evidence and t…

cs.GT20152 cited

Higher-Order Game Theory

Jules Hedges, Paulo Oliva, Evguenia Sprits +2

In applied game theory the motivation of players is a key element. It is encoded in the payoffs of the game form and often based on utility functions. But there are cases were form…

cs.GT20151 cited

String diagrams for game theory

Jules Hedges

This paper presents a monoidal category whose morphisms are games (in the sense of game theory, not game semantics) and an associated diagrammatic language. The two basic operation…

cs.PL20154 cited

The selection monad as a CPS transformation

Jules Hedges

A computation in the continuation monad returns a final result given a continuation, ie. it is a function with type . If we instead return the intermediate result…