• Corpus ID: 14299619

Higher-Order Game Theory

@article{Hedges2015HigherOrderGT,
  title={Higher-Order Game Theory},
  author={Jules Hedges and Paulo Oliva and Evguenia Sprits and Viktor Winschel and Philipp Zahn},
  journal={ArXiv},
  year={2015},
  volume={abs/1506.01002}
}
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 formal descriptions in the form of a utility function do not exist. In this paper we introduce a representation of games where players' goals are modeled based on so-called higher-order functions. Our representation provides a general and powerful way to mathematically summarize players' intentions. In our framework… 

Tables from this paper

Towards compositional game theory
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 operations from standard
Compositional Game Theory
TLDR
The concept of coutility is introduced, which is the utility generated by an open game and returned to its environment and it is shown that a variety of games can be faithfully represented as open games in the sense of having the same Nash equilibria and off-equilibrium best responses.
A compositional approach to economic game theory
TLDR
An new and original model of economic games based upon the computer science idea of compositionality is built, and the usual lexicon of games is augmented with a new concept of coutility, which guarantees the model is mathematically rigourous.
Higher-Order Decision Theory
This paper investigates a surprising relationship between decision theory and proof theory. Using constructions originating in proof theory based on higher-order functions, so called quantifiers and
Compositionality and String Diagrams for Game Theory
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, quantum computing

References

SHOWING 1-10 OF 20 REFERENCES
Sequential games and optimal strategies
  • M. Escardó, Paulo Oliva
  • Mathematics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2010
This article gives an overview of recent work on the theory of selection functions. We explain the intuition behind these higher type objects, and define a general notion of sequential game whose
A generalization of Nash's theorem with higher-order functionals
  • Julian Hedges
  • Economics, Mathematics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2013
TLDR
The Nash existence theorem for mixed-strategy equilibria of finite games is generalized to games defined by selection functions, and a normal form construction is given, which generalizes the game-theoretic normal form, and its soundness is proved.
A Course in Game Theory
A Course in Game Theory presents the main ideas of game theory at a level suitable for graduate students and advanced undergraduates, emphasizing the theory's foundations and interpretations of its
Higher-Order Decision Theory
This paper investigates a surprising relationship between decision theory and proof theory. Using constructions originating in proof theory based on higher-order functions, so called quantifiers and
Selection functions, bar recursion and backward induction
TLDR
This work explains bar recursion in terms of sequential games, and shows how it can be naturally understood as a generalisation of the principle of backward induction that arises in game theory.
Computing Nash Equilibria of Unbounded Games
TLDR
This work extends the well-known game-theoretic technique of backward induction to certain general classes of unbounded games and develops a closed formula for calculating strategy profiles in Nash equilibrium and subgame perfect equilibrium even in the case of games where the length of play is not a-priori fixed.
What sequential games, the tychonoff theorem and the double-negation shift have in common
TLDR
A higher-type functional is discussed, written here in the functional programming language Haskell, which optimally plays sequential games, implements a computational version of the Tychonoff Theorem from topology, and realizes the Double-Negation Shift from logic and proof theory.
The Strategy of Conflict.
I. Elements of a Theory of Strategy 1. The Retarded Science of International Strategy 2. An Essay on Bargaining 3. Bargaining, Communication, and Limited War II. A Reorientation of Game Theory 4.
Exhaustible Sets in Higher-type Computation
TLDR
A complete description of exhaustible total sets is obtained by developing a computational version of a topological Arzela--Ascoli type characterization of compact subsets of function spaces and shows that they are precisely the computable images of the Cantor space.
On a generalization of quantifiers
...
...