Compositional game theory, compositionally
From MaRDI portal
Publication:5019677
Abstract: We present a new compositional approach to compositional game theory (CGT) based upon Arrows, a concept originally from functional programming, closely related to Tambara modules, and operators to build new Arrows from old. We model equilibria as a bimodule over an Arrow and define an operator to build a new Arrow from such a bimodule over an existing Arrow. We also model strategies as graded Arrows and define an operator which builds a new Arrow by taking the colimit of a graded Arrow. A final operator builds a graded Arrow from a graded bimodule. We use this compositional approach to CGT to show how known and previously unknown variants of open games can be proven to form symmetric monoidal categories.
Recommendations
Cites work
- scientific article; zbMATH DE number 1956503 (Why is no real title available?)
- (Co)end Calculus
- A compositional treatment of iterated open games
- A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras
- A linear category of polynomial diagrams
- Arrows, like monads, are monoids
- Categorical logic and type theory
- Compositional game theory
- Dialectica categories and games with bidding
- Doubles for monoidal categories
- Framed bicategories and monoidal fibrations
- Generalising monads to arrows
- Morphisms of open games
- Notions of computation as monoids
- Parametric effect monads and semantics of effect systems
- What is a categorical model of arrows?
Cited in
(6)
This page was built for publication: Compositional game theory, compositionally
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019677)