Elena Di Lavore, Tallinn University of Technology
Compositional modelling of network games
Network games are used to model situations in which each agent can be influenced by only some of the other agents, namely its neighbours on a graph. We characterize a class of network games as monoidal functors from a category of syntax, the prop of graphs with boundaries, to a category of semantics, the category of open games. In order to do this, we develop a syntactic presentation of the prop of graphs with boundaries. This is joint work with Jules Hedges and Paweł Sobociński.