Distributed game-theoretic vertex coloring

Authors:
Ioannis Chatzigiannakis;Christos Koninis;Panagiota N. Panagopoulou;Paul G. Spirakis
Affiliations:
Computer Engineering and Informatics Department, Patras University and Research Academic Computer Technology Institute, Greece;Computer Engineering and Informatics Department, Patras University and Research Academic Computer Technology Institute, Greece;Research Academic Computer Technology Institute, Greece;Computer Engineering and Informatics Department, Patras University and Research Academic Computer Technology Institute, Greece
Venue:
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Year:
2010

Citing 9
Cited 1

A still better performance guarantee for approximate graph coloring

Information Processing Letters
Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Memory-Efficient Self Stabilizing Protocols for General Networks

WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Coloring unstructured radio networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A Game Theoretic Approach for Efficient Graph Coloring

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Coloring unstructured wireless multi-hop networks

Proceedings of the 28th ACM symposium on Principles of distributed computing
Wiselib: a generic algorithm library for heterogeneous sensor networks

EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks
Strategic coloring of a graph

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity

Distributed Welfare Games

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We exploit the game-theoretic ideas presented in [12] to study the vertex coloring problem in a distributed setting. The vertices of the graph are seen as players in a suitably defined strategic game, where each player has to choose some color, and the payoff of a vertex is the total number of players that have chosen the same color as its own. We extend here the results of [12] by showing that, if any subset of nonneighboring vertices perform a selfish step (i.e., change their colors in order to increase their payoffs) in parallel, then a (Nash equilibrium) proper coloring, using a number of colors within several known upper bounds on the chromatic number, can still be reached in polynomial time. We also present an implementation of the distributed algorithm in wireless networks of tiny devices and evaluate the performance in simulated and experimental environments. The performance analysis indicates that it is the first practically implementable distributed algorithm.