Reference. Compositional Modelling of Network Games

The analysis of games played on graph-like structures is of increasing importance due to the prevalence of social networks, both virtual and physical, in our daily life. As well as being relevant in computer science, mathematical analysis and computer simulations of such distributed games are vital methodologies in economics, politics and epidemiology, amongst other fields. Our contribution is to give compositional semantics of a family of such games as a well-behaved mapping, a strict monoidal functor, from a category of open graphs (syntax) to a category of open games (semantics). As well as introducing the theoretical framework, we identify some applications of compositionality.

Cite

Cite as @dilavore-2021-compositional (helia, typst) · \cite{dilavore-2021-compositional} (LaTeX)
BibTeX
bibtex · 14 lines
@inproceedings{dilavore-2021-compositional,
  doi = {10.4230/LIPICS.CSL.2021.30},
  url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.30},
  author = {Di Lavore, Elena and Hedges, Jules and Sobociński, Paweł},
  keywords = {game theory, category theory, network games, open games, open graphs, compositionality, Theory of computation → Categorical semantics},
  language = {en},
  title = {Compositional Modelling of Network Games},
  volume = {183},
  pages = {30:1-30:24},
  publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
  year = {2021},
  copyright = {Creative Commons Attribution 3.0 Unported license},
  booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)}
}
hayagriva YAML (typst)
yaml · 17 lines
dilavore-2021-compositional:
  type: article
  title: Compositional Modelling of Network Games
  author:
  - Di Lavore, Elena
  - Hedges, Jules
  - Sobociński, Paweł
  date: 2021
  page-range: 30:1-30:24
  url: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.30
  serial-number:
    doi: 10.4230/LIPICS.CSL.2021.30
  parent:
    type: proceedings
    title: 29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
    publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
    volume: 183
Cites 22 works (2 here)
With notes (2)

Bayesian open games bolt-2023-bayesian

This paper generalises the treatment of compositional game theory as introduced by Ghani et al. in 2018, where games are modelled as morphisms of a symmetric monoidal category. From an economic modelling perspective, the notion of a game in the work by Ghani et al. is not expressive enough for many applications. This includes stochastic environments, stochastic choices by players, as well as incomplete information regarding the game being played. The current paper addresses these three issues all at once.
DOI · arXiv

Compositional Game Theory ghani-2018-compositional

DOI · arXiv
External (20)
dilavore-2021-compositional reference entries/refs/dilavore-2021-compositional/dilavore-2021-compositional.hel