Related papers: Garbage disposal game on finite graphs
We study a variant of the chip-firing game called the diffusion game. In the diffusion game, we begin with some integer labelling of the vertices of a graph, interpreted as a number of chips on each vertex, and then for each subsequent step…
A game has approximate equilibria if for every $\epsilon >0$ there is an $\epsilon$-equilibrium. We show that there is a stochastic game that lacks approximate equilibria. This game has finitely many players and actions, their payoffs are…
Many distributed systems can be modeled as network games: a collection of selfish players that communicate in order to maximize their individual utilities. The performance of such games can be evaluated through the costs of the system…
We investigate the phenomenon of diffusion in a countably infinite society of individuals interacting with their neighbors in a network. At a given time, each individual is either active or inactive. The diffusion is driven by two…
A key challenge in responding to public health crises such as COVID-19 is the difficulty of predicting the results of feedback interconnections between the disease and society. As a step towards understanding these interconnections, we pose…
Clustering a graph, i.e., assigning its nodes to groups, is an important operation whose best known application is the discovery of communities in social networks. Graph clustering and community detection have traditionally focused on…
We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend…
A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble…
We introduce a framework for stochastic games on large sparse graphs, covering continuous-time and discrete-time dynamic games as well as static games. Players are indexed by the vertices of simple, locally finite graphs, allowing both…
Recently the matcher game was introduced. In this game, two players create a maximal matching by one player repeatedly choosing a vertex and the other player choosing a $K_2$ containing that vertex. One player tries to minimize the result…
Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players choosing the same resource. In network congestion games…
In this paper we introduce the novel framework of distributionally robust games. These are multi-player games where each player models the state of nature using a worst-case distribution, also called adversarial distribution. Thus each…
We study a recently introduced class of strategic games that is motivated by and generalizes Schelling's well-known residential segregation model. These games are played on undirected graphs, with the set of agents partitioned into multiple…
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…
Given a family of graphs $\mathcal{F}$, we consider the $\mathcal{F}$-saturation game. In this game two players alternate adding edges to an initially empty graph on $n$ vertices, with the only constraint being that neither player can add…
Two-player graph games are a fundamental model for reasoning about the interaction of agents. These games are played between two players who move a token along a graph. In bidding games, the players have some monetary budget, and at each…
Public Goods Games represent one of the most useful tools to study group interactions between individuals. However, even if they could provide an explanation for the emergence and stability of cooperation in modern societies, they are not…
Evolutionary games on networks traditionally involve the same game at each interaction. Here we depart from this assumption by considering mixed games, where the game played at each interaction is drawn uniformly at random from a set of two…
Evolutionary game dynamics in structured populations has been extensively explored in past decades. However, most previous studies assume that payoffs of individuals are fully determined by the strategic behaviors of interacting parties and…
Segregation is widespread in all realms of human society. Several influential studies have argued that intolerance is not a prerequisite for a segregated society, and that segregation can arise even when people generally prefer diversity.…