A compositional treatment of iterated open games

Research output: Contribution to journalArticle

2 Citations (Scopus)
25 Downloads (Pure)

Abstract

Compositional Game Theory is a new, recently introduced model of economic games based upon the computer science idea of compositionality. In it, complex and irregular games can be built up from smaller and simpler games, and the equilibria of these complex games can be defined recursively from the equilibria of their simpler subgames. This paper extends the model by providing a final coalgebra semantics for infinite games. In the course of this, we introduce a new operator on games to model the economic concept of subgame perfection.
Original languageEnglish
Pages (from-to)48-57
Number of pages10
JournalTheoretical Computer Science
Volume741
Early online date29 May 2018
DOIs
Publication statusPublished - 12 Sep 2018

    Fingerprint

Keywords

  • compositional game theory
  • final coalgebra semantics
  • infinite iterated games
  • subgame perfection

Cite this