Compositional modelling of network games

Di Lavore, Elena and Hedges, Jules and Sobociński, Paweł; Baier, Christel and Goubault-Larrecq, Jean, eds. (2021) Compositional modelling of network games. In: 29th EACSL Annual Conference on Computer Science Logic, CSL 2021. Leibniz International Proceedings in Informatics, LIPIcs . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, SVN. ISBN 9783959771757

[thumbnail of Di-Lavore-etal-EACSL-2021-Compositional-modelling-of-network-games]
Preview
Text (Di-Lavore-etal-EACSL-2021-Compositional-modelling-of-network-games)
Di_Lavore_etal_EACSL_2021_Compositional_modelling_of_network_games.pdf
Final Published Version
License: Creative Commons Attribution 3.0 logo

Download (441kB)| Preview

    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.