A compositional treatment of iterated open games

Research output: Contribution to journalArticle

  • 1 Citations

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.
LanguageEnglish
Pages48-57
Number of pages10
JournalTheoretical Computer Science
Volume741
Early online date29 May 2018
DOIs
StatePublished - 12 Sep 2018

Fingerprint

Game
Economics
Game theory
Infinite Games
Compositionality
Simple Game
Computer science
Coalgebra
Game Theory
Semantics
Irregular
Computer Science
Model
Operator
Concepts

Keywords

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

Cite this

@article{b773c3697b374678aea9d38afd3f760e,
title = "A compositional treatment of iterated open games",
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.",
keywords = "compositional game theory, final coalgebra semantics, infinite iterated games, subgame perfection",
author = "Neil Ghani and Clemens Kupke and Alasdair Lambert and {Nordvall Forsberg}, Fredrik",
year = "2018",
month = "9",
day = "12",
doi = "10.1016/j.tcs.2018.05.026",
language = "English",
volume = "741",
pages = "48--57",
journal = "Theoretical Computer Science",
issn = "0304-3975",

}

TY - JOUR

T1 - A compositional treatment of iterated open games

AU - Ghani,Neil

AU - Kupke,Clemens

AU - Lambert,Alasdair

AU - Nordvall Forsberg,Fredrik

PY - 2018/9/12

Y1 - 2018/9/12

N2 - 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.

AB - 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.

KW - compositional game theory

KW - final coalgebra semantics

KW - infinite iterated games

KW - subgame perfection

UR - https://www.sciencedirect.com/journal/theoretical-computer-science

U2 - 10.1016/j.tcs.2018.05.026

DO - 10.1016/j.tcs.2018.05.026

M3 - Article

VL - 741

SP - 48

EP - 57

JO - Theoretical Computer Science

T2 - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -