Related papers: Games on graphs: A minor modification of payoff sc…
We study the problem of repeated play in a zero-sum game in which the payoff matrix may change, in a possibly adversarial fashion, on each round; we call these Online Matrix Games. Finding the Nash Equilibrium (NE) of a two player zero-sum…
This article investigates an evolutionary game based on the framework of interacting particle systems. Each point of the square lattice is occupied by a player who is characterized by one of two possible strategies and is attributed a…
We investigate the effects of update rules on the dynamics of an evolutionary game-theoretic model - the N-player evolutionary trust game - consisting of three types of players: investors, trustworthy trustees, and untrustworthy trustees.…
Peer-To-Peer (P2P) networks are self-organizing, distributed systems, with no centralized authority or infrastructure. Because of the voluntary participation, the availability of resources in a P2P system can be highly variable and…
Game theory formalizes certain interactions between physical particles or between living beings in biology, sociology, and economics, and quantifies the outcomes by payoffs. The prisoner's dilemma (PD) describes situations in which it is…
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…
This paper studies the rationalization and identification of binary games where players have correlated private types. Allowing for correlation is crucial in global games and in models with social interactions as it represents correlated…
User-generated content can be distributed at a low cost using peer-to-peer (P2P) networks, but the free-rider problem hinders the utilization of P2P networks. In order to achieve an efficient use of P2P networks, we investigate fundamental…
This paper studies an incentive structure for cooperation and its stability in peer-assisted services when there exist multiple content providers, using a coalition game theoretic approach. We first consider a generalized coalition…
We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of…
The notions of symmetry and anonymity in strategic games have been formalized in different ways in the literature. We propose a combinatorial framework to analyze these notions, using group actions. Then, the same framework is used to…
In constructing an econometric or statistical model, we pick relevant features or variables from many candidates. A coalitional game is set up to study the selection problem where the players are the candidates and the payoff function is a…
When opposing parties compete for a prize, the sunk effort players exert during the conflict can affect the value of the winner's reward. These spillovers can have substantial influence on the equilibrium behavior of participants in…
The Optional Public Goods Game is a three-strategy game in which an individual can play as a cooperator or defector or decide not to participate. Despite its simplicity, this model can effectively represent many human social dilemmas, such…
In structured populations the spatial arrangement of cooperators and defectors on the interaction graph together with the structure of the graph itself determines the game dynamics and particularly whether or not fixation of cooperation (or…
Studying the impact of cooperation in strategic settings is one of the cornerstones of algorithmic game theory. Intuitively, allowing more cooperation yields equilibria that are more beneficial for the society of agents. However, for many…
The strategy improvement algorithm for mean payoff games and parity games is a local improvement algorithm, just like the simplex algorithm for linear programs. Their similarity has turned out very useful: many lower bounds on running time…
We consider evolutionary games on a population whose underlying topology of interactions is determined by a binomial random graph $G(n,p)$. Our focus is on 2-player symmetric games with 2 strategies played between the incident members of…
In this paper the results of a simulation of a prisoner's dilemma robin-round tournament are presented. In the tournament each participating strategy plays an iterated prisoner's dilemma against each other strategy (round-robin) and as a…
In communication systems where users share common resources, users' selfish behavior usually results in suboptimal resource utilization. There have been extensive works that model communication systems with selfish users as one-shot games…