Atomic Congestion Games on Graphs and Its Applications in Networking
In this paper, the authors introduce and analyze the properties of a class of game, the Atomic Congestion Game on Graphs (ACGG), which is a generalization of the classical congestion game. In particular, the ACGG captures the spatial information which is often ignored in the classical congestion game. This is useful in many networking problems, e.g., wireless networks where interference among the users heavily depend on the spatial information. In an ACGG, a player's payoff for using a resource is a function of the number of players who interact with it and use the same resource. Such spatial information can be captured by a graph.