Related papers: Games on graphs: A minor modification of payoff sc…
Many real-world systems are composed of interdependent networks that rely on one another. Such networks are typically designed and operated by different entities, who aim at maximizing their own payoffs. There exists a game among these…
In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the…
We consider network contribution games, where each agent in a social network has a budget of effort that he can contribute to different collaborative projects or relationships. Depending on the contribution of the involved agents a…
Game Theory has been frequently applied in biological research since 1970s. While the key idea of Game Theory is Nash Equilibrium, it is critical to understand and figure out the payoff matrix in order to calculate Nash Equilibrium. In this…
A recurring theme in recent computer science literature is that proper design of signaling schemes is a crucial aspect of effective mechanisms aiming to optimize social welfare or revenue. One of the research endeavors of this line of work…
Strategy changes are an essential part of evolutionary games. Here we introduce a simple rule that, depending on the value of a single parameter $w$, influences the selection of players that are considered as potential sources of the new…
We consider the repeated prisoner's dilemma (PD). We assume that players make their choices knowing only average payoffs from the previous stages. A player's strategy is a function from the convex hull $\mathfrak{S}$ of the set of payoffs…
Parrondo's paradox refers to the counter-intuitive situation where a winning strategy results from a suitable combination of losing ones. Simple stochastic games exhibiting this paradox have been introduced around the turn of the…
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…
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety…
Complex networks are a great tool for simulating the outcomes of different strategies used within the iterated prisoners' dilemma game. However, because the strategies themselves rely on the connection between nodes, then initial network…
Game theory has been one of the most successful quantitative concepts to describe social interactions, their strategical aspects, and outcomes. Among the payoff matrix quantifying the result of a social interaction, the interaction…
We study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on…
We propose a generic mechanism for incentivizing behavior in an arbitrary finite game using payments. Doing so is trivial if the mechanism is allowed to observe all actions taken in the game, as this allows it to simply punish those agents…
Toral introduced so-called cooperative Parrondo games, in which there are N players (3 or more) arranged in a circle. At each turn one player is randomly chosen to play. He plays either game A or game B, depending on the strategy. Game A…
We study strategic games on weighted directed graphs, where 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 bonus for picking a given…
We consider evolutionary games in which the agent selected for update compares their payoff to q neighbours, rather than a single neighbour as in standard evolutionary game theory. Through studying fixed point stability and fixation times…
In recent years, there has been growing interest in studying games on multiplex networks that account for interactions across linked social contexts. However, little is known about how potential cross-context interference, or spillover, of…
In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In {\em bidding…
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…