Compositional modelling of network games

Elena Di Lavore, Jules Hedges, Paweł Sobociński

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

1 Downloads (Pure)

Abstract

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.

Original languageEnglish
Title of host publication29th EACSL Annual Conference on Computer Science Logic, CSL 2021
EditorsChristel Baier, Jean Goubault-Larrecq
Place of PublicationDagstuhl, Germany
Number of pages25
ISBN (Electronic)9783959771757
DOIs
Publication statusPublished - 13 Jan 2021
Event29th EACSL Annual Conference on Computer Science Logic, CSL 2021 - Virtual, Ljubljana, Slovenia
Duration: 25 Jan 202128 Jan 2021

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume183
ISSN (Print)1868-8969

Conference

Conference29th EACSL Annual Conference on Computer Science Logic, CSL 2021
CountrySlovenia
CityVirtual, Ljubljana
Period25/01/2128/01/21

Keywords

  • category theory
  • compositionality
  • game theory
  • network games
  • open games
  • open graphs

Fingerprint Dive into the research topics of 'Compositional modelling of network games'. Together they form a unique fingerprint.

Cite this