Related papers: A Characterization of Complexity in Public Goods G…
Motivated by understanding non-strict and strict pure strategy equilibria in network anti-coordination games, we define notions of stable and, respectively, strictly stable colorings in graphs. We characterize the cases when such colorings…
Markovian network equilibrium generalizes the classical Wardrop equilibrium in network games. At a Markovian network equilibrium, each player of the game solves a Markov decision process instead of a shortest path problem. We propose two…
We initiate the study of a quantity that we call coordination complexity. In a distributed optimization problem, the information defining a problem instance is distributed among $n$ parties, who need to each choose an action, which jointly…
In this manuscript we explore the onset of cooperative traits in the Public Goods game. This well-known game involves N-agent interactions and thus reproduces a large number of social scenarios in which cooperation appears to be essential.…
Cooperation in heterogeneous groups, where individuals differ in resources, productivity, and behavioural responsiveness, underpins collective action across many social and biological systems. Introspection dynamics, in which each player…
Recently, Apt and Markakis introduced a model for product adoption in social networks with multiple products, where the agents, influenced by their neighbours, can adopt one out of several alternatives (products). To analyze these networks…
Is it rational for selfish individuals to cooperate? The conventional answer based on analysis of games such as the Prisoners Dilemma (PD) is that it is not, even though mutual cooperation results in a better outcome for all. This…
We prove that finding an $\epsilon$-approximate Nash equilibrium is PPAD-complete for constant $\epsilon$ and a particularly simple class of games: polymatrix, degree 3 graphical games, in which each player has only two actions. As…
In a community-structured population, public goods games (PGG) occur both within and between communities. Such type of PGG is referred as multilevel public goods games (MPGG). We propose a minimalist evolutionary model of the MPGG and…
Decision-making individuals are often considered to be either imitators who copy the action of their most successful neighbors or best-responders who maximize their benefit against the current actions of their neighbors. In the context of…
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…
We consider the dynamics, existence and stability of the equilibrium states for large populations of individuals who can play various types of non--cooperative games. The players imitate the most attractive strategies, and the choice is…
Strategic games admit a multi-graph representation, in which two kinds of relations, accessibility, and preferences, are used to describe how the players compare the possible outcomes. A category of games with a fixed set of players…
This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…
Coordination games describe social or economic interactions in which the adoption of a common strategy has a higher payoff. They are classically used to model the spread of conventions, behaviors, and technologies in societies. Here we…
This paper considers games where the utilities for agents are the sum of a term proportional to a social utility, and another term that is an individual cost or reward. The agents are assumed to be irrational in their perception of the…
A Nash equilibrium has become important solution concept for analyzing the decision making in Game theory. In this paper, we consider the problem of computing Nash equilibria of a subclass of generic finite normal form games. We define…
We propose a distributed algorithm to compute an equilibrium in aggregate games where players communicate over a fixed undirected network. Our algorithm exploits correlated perturbation to obfuscate information shared over the network. We…
We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium…
We study strategic games on weighted directed graphs, in which 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 integer bonus for picking a…