A note on the network coloring game

by   Nikolaos Fryganiotis, et al.

The network coloring game has been proposed in the literature of social sciences as a model for conflict-resolution circumstances. The players of the game are the vertices of a graph with n vertices and maximum degree Δ. The game is played over rounds, and in each round all players simultaneously choose a color from a set of available colors. Players have local information of the graph: they only observe the colors chosen by their neighbors and do not communicate or cooperate with one another. A player is happy when she has chosen a color that is different from the colors chosen by her neighbors, otherwise she is unhappy, and a configuration of colors for which all players are happy is a proper coloring of the graph. It has been shown in the literature that, when the players adopt a particular greedy randomized strategy, the game reaches a proper coloring of the graph within O(log(n)) rounds, with high probability, provided the number of colors available to each player is at least Δ+2. In this note we show that a modification of the aforementioned greedy strategy yields likewise a proper coloring of the graph, provided the number of colors available to each player is at least Δ+1.



page 1

page 2

page 3

page 4


On the Hat Guessing Number of Graphs

The hat guessing number HG(G) of a graph G on n vertices is defined in t...

Coalition Resilient Outcomes in Max k-Cut Games

We investigate strong Nash equilibria in the max k-cut game, where we ar...

Markov Chain Approaches to Payoff Optimization in the Self-Organizing Network Coloring Game

The model of Network Coloring Game (NCG) is used to simulate conflict re...

The Buck-Passing Game

We consider a model where agents want to transfer the responsibility of ...

The hat guessing number of graphs

Consider the following hat guessing game: n players are placed on n vert...

e-Valuate: A Two-player Game on Arithmetic Expressions -- An Update

e-Valuate is a game on arithmetic expressions. The players have contrast...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.