Related papers: Population Protocols that Correspond to Symmetric …

The design of coherent and efficient policies to address infectious diseases and their consequences requires to model not only epidemics dynamics, but also individual behaviors, as the latter has a strong influence on the former. In our…

Schelling games model the wide-spread phenomenon of residential segregation in metropolitan areas from a game-theoretic point of view. In these games agents of different types each strategically select a node on a given graph that models…

We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a…

For vertex cover games (introduced by Deng et al., Math. Oper. Res., 24:751-766, 1999), we investigate population monotonic allocation schemes (introduced by Sprumont, Games Econ. Behav., 2: 378-394, 1990). We show that the existence of a…

Population protocols are a model of computation in which indistinguishable mobile agents interact in pairs to decide a property of their initial configuration. Originally introduced by Angluin et. al. in 2004 with a constant number of…

Evolutionary graph theory is a well established framework for modelling the evolution of social behaviours in structured populations. An emerging consensus in this field is that graphs that exhibit heterogeneity in the number of connections…

We investigate the dynamics of coordination and consensus in an agent population. Considering agents endowed with bounded rationality, we study asymmetric coordination games using a mapping to random field Ising models. In doing so, we…

Population protocols are a distributed computing model appropriate for describing massive numbers of agents with limited computational power. A population protocol "has an initial leader" if every valid initial configuration contains a…

We review research papers which use game theory to model the decision making of individuals during an epidemic, attempting to classify the literature and identify the emerging trends in this field. We show that the literature can be…

Interacting with human agents in complex scenarios presents a significant challenge for robotic navigation, particularly in environments that necessitate both collision avoidance and collaborative interaction, such as indoor spaces. Unlike…

Evolutionary game dynamics of two players with two strategies has been studied in great detail. These games have been used to model many biologically relevant scenarios, ranging from social dilemmas in mammals to microbial diversity. Some…

Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational…

Over the past few decades, many works have studied the evolutionary dynamics of continuous games. However, previous works have primarily focused on two-player games with pairwise interactions. Indeed, group interactions rather than pairwise…

Game-theoretic dynamics between AI agents could differ from traditional human-human interactions in various ways. One such difference is that it may be possible to accurately simulate an AI agent, for example because its source code is…

In this paper we study population protocols governed by the {\em random scheduler}, which uniformly at random selects pairwise interactions between $n$ agents. The main result of this paper is the first time and space optimal {\em exact…

Network congestion games are a well-understood model of multi-agent strategic interactions. Despite their ubiquitous applications, it is not clear whether it is possible to design information structures to ameliorate the overall experience…

Evolutionary game dynamics in finite populations provides a new framework to understand the selection of traits with frequency-dependent fitness. Recently, a simple but fundamental law of evolutionary dynamics, which we call {\sigma} law,…

We investigate a prototypical agent-based model, the Naming Game, on two-dimensional random geometric networks. The Naming Game [A. Baronchelli et al., J. Stat. Mech.: Theory Exp. (2006) P06014.] is a minimal model, employing local…

We analyze a cooperative game, where the cooperative act is not based on the previous behaviour of the co-player, but on the similarity between the players. This system has been studied in a mean-field description recently [A. Traulsen and…

While we would like agents that can coordinate with humans, current algorithms such as self-play and population-based training create agents that can coordinate with themselves. Agents that assume their partner to be optimal or similar to…