Related papers: Complex behaviour in cyclic competition bimatrix g…
Rock is wrapped by paper, paper is cut by scissors, and scissors are crushed by rock. This simple game is popular among children and adults to decide on trivial disputes that have no obvious winner, but cyclic dominance is also at the heart…
The emergence of complex networks from evolutionary games is studied occurring when agents are allowed to switch interaction partners. For this purpose a coevolutionary iterated Prisoner's Dilemma game is defined on a random network with…
Various social contexts ranging from public goods provision to information collection can be depicted as games of strategic interactions, where a player's well-being depends on her own action as well as on the actions taken by her…
We study the network replicator equation and characterize its fixed points on arbitrary graph structures for $2 \times 2$ symmetric games. We show a relationship between the asymptotic behavior of the network replicator and the existence of…
When playing games in groups, it is an advantage for individuals to have accurate statistical information on the strategies of their opponents. Such information may be obtained by remembering previous interactions. We consider a…
We generalize the Bush--Mosteller learning, the Roth--Erev learning, and the social learning to include mistakes such that the nonlinear replicator-mutator equation with either additive or multiplicative mutation is generated in an…
We study diffusion on a multilayer network where the contact dynamics between the nodes is governed by a random process and where the waiting time distribution differs for edges from different layers. We study the impact on a random walk of…
In this paper, we consider a learning problem among non-cooperative agents interacting in a time-varying system. Specifically, we focus on repeated linear quadratic network games, in which the network of interactions changes with time and…
Self-play is a technique for machine learning in multi-agent systems where a learning algorithm learns by interacting with copies of itself. Self-play is useful for generating large quantities of data for learning, but has the drawback that…
We consider coalition formation among players in an n-player finite strategic game over infinite horizon. At each time a randomly formed coalition makes a joint deviation from a current action profile such that at new action profile all…
We study the generalised rock-paper-scissors game with five species whose organisms face local epidemic outbreaks. As an evolutionary behavioural survival strategy, organisms of one out of the species move in the direction with more enemies…
Cooperation is a very common, yet not fully-understood phenomenon in natural and human systems. The introduction of a network within the population is known to affect the outcome of cooperative dynamics, allowing for the survival of…
We model a situation in which a collection of species derive their fitnesses via a rock-paper-scissors-type game; however, the precise payoffs are a function of the environment. The new aspect of our model lies in adding a feedback loop:…
We describe a formulation of multi-agents operating within a Cyber-Physical System, resulting in collaborative or adversarial games. We show that the non-determinism inherent in the communication medium between agents and the underlying…
Learning in games considers how multiple agents maximize their own rewards through repeated games. Memory, an ability that an agent changes his/her action depending on the history of actions in previous games, is often introduced into…
Consider a set of agents who play a network game repeatedly. Agents may not know the network. They may even be unaware that they are interacting with other agents in a network. Possibly, they just understand that their payoffs depend on an…
In a network game, players interact over a network and the utility of each player depends on his own action and on an aggregate of his neighbours' actions. Many real world networks of interest are asymmetric and involve a large number of…
We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed non-negative integer bonus for picking a…
The stability of heteroclinic cycles may be obtained from the value of the local stability index along each connection of the cycle. We establish a way of calculating the local stability index for quasi-simple cycles: cycles whose…
We investigate the impact of cyclic competition on pattern formation in the rock-paper-scissors game. By separately considering random and prepared initial conditions, we observe a critical influence of the competition rate $p$ on the…