Atomic Congestion Games on Graphs and Their Applications in Networking

In this paper, the authors introduce and analyze the properties of a class of games, the Atomic Congestion Games on Graphs (ACGGs), which is a generalization of the classical congestion games. In particular, an ACGG captures the spatial information that is often ignored in a classical congestion game. This is useful in many networking problems, e.g., wireless networks where interference among the users heavily depends 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.

Provided by: Institute of Electrical & Electronic Engineers Topic: Mobility Date Added: Jan 2012 Format: PDF

Find By Topic