Game dynamics on graphs
Directed or undirected graphs are the most natural way of a mathematical description of interacting agents. The vertices of the graph can hold information about the agent, while the edges represent their spatial structure. Such a model is particularly useful if the agents are described by a game-theoretical framework. Then the vertices represent the strategies which each agent employs, while the edges serve as the spatial interaction. Such a description also integrates dynamics as the agent’s strategies as well as their interaction may change over time. In the talk recent results on game dynamics on graphs are presented and possible field of application for systems and automation are discussed.