Related papers: Approachability in Population Games
This paper investigates the model for pedestrian flow firstly proposed in [Cristiani et al., DOI:10.1137/140962413]. The model assumes that each individual in the crowd moves in a known domain, aiming at minimizing a given cost functional.…
This paper uses category theory to develop an entirely new approach to approximate game theory. Game theory is the study of how different agents within a multi-agent system take decisions. At its core, game theory asks what an optimal…
The use of game theoretic models has been quite successful in describing various cooperative and non-cooperative optimization problems in networks and other domains of computer systems. In this paper, we study an application of game…
We introduce Mean Field Markov games with $N$ players, in which each individual in a large population interacts with other randomly selected players. The states and actions of each player in an interaction together determine the…
We consider the adaptive learning rule of Harley (1981) for behavior selection in symmetric conflict games in large populations. The rule uses organisms' past, accumulated rewards as the predictor for the future behavior, and can be traced…
We study $n$-player turn-based games played on a finite directed graph. For each play, the players have to pay a cost that they want to minimize. Instead of the well-known notion of Nash equilibrium (NE), we focus on the notion of subgame…
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 an SIR model of epidemic propagation on networks in the context of mean-field games. In a real epidemic, individuals adjust their behavior depending on the epidemic level and the impact it might have on them in the future.…
Two fundamental problems in computational game theory are computing a Nash equilibrium and learning to exploit opponents given observations of their play (opponent exploitation). The latter is perhaps even more important than the former:…
Adaptive machines have the potential to assist or interfere with human behavior in a range of contexts, from cognitive decision-making to physical device assistance. Therefore it is critical to understand how machine learning algorithms can…
Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph…
Interactions between people are the basis on which the structure of our society arises as a complex system and, at the same time, are the starting point of any physical description of it. In the last few years, much theoretical research has…
Adaptive populations such as those in financial markets and distributed control can be modeled by the Minority Game. We consider how their dynamics depends on the agents' initial preferences of strategies, when the agents use linear or…
In recent years, there has been a growing interest in games on graphs within the research community, fueled by their relevance in applications such as economics, politics, and epidemiology. This paper aims to comprehensively detail the…
In lowest unique bid auctions, $N$ players bid for an item. The winner is whoever places the \emph{lowest} bid, provided that it is also unique. We use a grand canonical approach to derive an analytical expression for the equilibrium…
Research in adversarial learning follows a cat and mouse game between attackers and defenders where attacks are proposed, they are mitigated by new defenses, and subsequently new attacks are proposed that break earlier defenses, and so on.…
The study of evolutionary games with pairwise local interactions has been of interest to many different disciplines. Also local interactions with multiple opponents had been considered, although always for a fixed amount of players. In many…
Mean-Field Games are games with a continuum of players that incorporate the time-dimension through a control-theoretic approach. Recently, simpler approaches relying on the Best Reply Strategy have been proposed. They assume that the agents…
Population protocols have been introduced by Angluin et {al.} as a model of networks consisting of very limited mobile agents that interact in pairs but with no control over their own movement. A collection of anonymous agents, modeled by…
Studying continuous time counterpart of some discrete time dynamics is now a standard and fruitful technique, as some properties hold in both setups. In game theory, this is usually done by considering differential games on Euclidean…