Higher-order Game Theory
Supervisor: Dr Paulo Oliva
Research group(s): Theory
This project aims to re-develop Game Theory using notions of higher-type computation, as in
All notions of Game Theory (such as player, game, strategy, equilibrium) can be recast in terms of higher-order constructions, or properties of such constructions. More details can be found in:
- Computing Nash Equilibria of Unbounded Games
- What Sequential Games, the Tychonoff Theorem and the Double-Negation Shift have in Common
Some knowledge of a strongly typed functional language such as Haskell would be desirable.