A compositional treatment of iterated open games

Neil Ghani; Clemens Kupke; Alasdair Lambert; Fredrik Nordvall Forsberg

doi:10.1016/j.tcs.2018.05.026

A compositional treatment of iterated open games

Neil Ghani, Clemens Kupke, Alasdair Lambert, Fredrik Nordvall Forsberg

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

63 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 language	English
Pages (from-to)	48-57
Number of pages	10
Journal	Theoretical Computer Science
Volume	741
Early online date	29 May 2018
DOIs	https://doi.org/10.1016/j.tcs.2018.05.026
Publication status	Published - 12 Sept 2018

Keywords

compositional game theory
final coalgebra semantics
infinite iterated games
subgame perfection

Access to Document

10.1016/j.tcs.2018.05.026Licence: CC BY 4.0

Ghani-etal-TCS-2018-A-compositional-treatment-of-iterated-open-gamesFinal published version, 335 KBLicence: CC BY 4.0

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 = sep,

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

SN - 0304-3975

VL - 741

SP - 48

EP - 57

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

A compositional treatment of iterated open games

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Fredrik Nordvall Forsberg

Coalgebraic Foundations of Semi-Structured Data (EPSRC First Grant)

Homotopy Type Theory: Programming and Verification

Logical Relations for Program Verification

Cite this

A compositional treatment of iterated open games

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Profiles

Fredrik Nordvall Forsberg

Projects

Coalgebraic Foundations of Semi-Structured Data (EPSRC First Grant)

Homotopy Type Theory: Programming and Verification

Logical Relations for Program Verification

Cite this