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 language | English |
---|---|
Title of host publication | 29th EACSL Annual Conference on Computer Science Logic, CSL 2021 |
Editors | Christel Baier, Jean Goubault-Larrecq |
Place of Publication | Dagstuhl, Germany |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Number of pages | 25 |
ISBN (Electronic) | 9783959771757 |
DOIs | |
Publication status | Published - 13 Jan 2021 |
Event | 29th EACSL Annual Conference on Computer Science Logic, CSL 2021 - Virtual, Ljubljana, Slovenia Duration: 25 Jan 2021 → 28 Jan 2021 |
Publication series
Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Volume | 183 |
ISSN (Print) | 1868-8969 |
Conference
Conference | 29th EACSL Annual Conference on Computer Science Logic, CSL 2021 |
---|---|
Country/Territory | Slovenia |
City | Virtual, Ljubljana |
Period | 25/01/21 → 28/01/21 |
Funding
Elena Di Lavore and Pawe? Soboci?ski are supported by the ESF funded Estonian IT Academy research measure (project 2014-2020.4.05.19-0001).
Keywords
- category theory
- compositionality
- game theory
- network games
- open games
- open graphs