Related papers: Network reconstruction from asynchronously updated…
The theory of repeated games analyzes the long-term relationship of interacting players and mathematically reveals the condition of how cooperation is achieved, which is not achieved in a one-shot game. In the repeated prisoner's dilemma…
Mean-field games with absorption is a class of games, that have been introduced in Campi and Fischer (2018) and that can be viewed as natural limits of symmetric stochastic differential games with a large number of players who, interacting…
This paper deals with modeling of network's dynamic using evolutionary games approach. Today there are many different protocols for data transmission through the Internet, providing users with better or worse service. The process of…
In this paper, we consider the $n \times n$ two-payer zero-sum repeated game in which one player (player X) employs the popular Hedge (also called multiplicative weights update) learning algorithm while the other player (player Y) adopts…
It has been an old unsolved puzzle to evolutionary theorists on which mechanisms would increase large-scale cooperation in human societies. Thus, how such mechanisms operate in a biological network is still not very understood. This study…
In spatial games players typically alter their strategy by imitating the most successful or one randomly selected neighbor. Since a single neighbor is taken as reference, the information stemming from other neighbors is neglected, which…
We study the evolution of cooperation in populations where individuals play prisoner's dilemma on a network. Every node of the network corresponds on an individual choosing whether to cooperate or defect in a repeated game. The players…
Spatial evolutionary games provide a valuable framework for elucidating the emergence and maintenance of cooperative behavior. However, most previous studies assume that individuals are profiteers and neglect to consider the effects of…
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…
This paper develops a deep policy iteration method for high-dimensional finite-horizon mean-field games (MFG). We reformulate the game as a regenerative problem with deterministic cycles, which allows policy evaluation (PE), policy…
While many theoretical studies have revealed the strategies that could lead to and maintain cooperation in the Iterated Prisoner's Dilemma, less is known about what human participants actually do in this game and how strategies change when…
In this paper we study the cooperative behavior of agents playing the Prisoner's Dilemma game in random scale-free networks. We show that the survival of cooperation is enhanced with respect to random homogeneous graphs but, on the other…
We have studied an evolutionary prisoner's dilemma game with players located on two types of random regular graphs with a degree of 4. The analysis is focused on the effects of payoffs and noise (temperature) on the maintenance of…
When people play a repeated game they usually try to anticipate their opponents' moves based on past observations, and then decide what action to take next. Behavioural economics studies the mechanisms by which strategic decisions are taken…
We formulate a resource-planning game between an attacker and a defender of a network control system. We consider the network to be operating in closed-loop with a linear quadratic regulator (LQR). We construct a general-sum, two-player,…
We propose a policy iteration method to solve an inverse problem for a mean-field game (MFG) model, specifically to reconstruct the obstacle function in the game from the partial observation data of value functions, which represent the…
To investigate the origin of cooperative behaviors, we developed an evolutionary model of sequential strategies and tested our model with computer simulations. The sequential strategies represented by stochastic machines were evaluated…
We study a dynamic game with a large population of players who choose actions from a finite set in continuous time. Each player has a state in a finite state space that evolves stochastically with their actions. A player's reward depends…
We consider a network of coupled agents playing the Prisoner's Dilemma game, in which players are allowed to pick a strategy in the interval [0,1], with 0 corresponding to defection, 1 to cooperation, and intermediate values representing…
We investigate two paradigms for studying the evolution of cooperation--Prisoner's Dilemma and Snowdrift game in an online friendship network obtained from a social networking site. We demonstrate that such social network has small-world…