Congestion Games on Weighted Directed Graphs, With Applications to Spectrum Sharing
Source: Chinese University of Hong Kong
With the advance of complex large-scale networks, it is becoming increasingly important to understand how selfish and spatially distributed individuals will share network resources without centralized co-ordinations. In this paper, the authors introduce the Graphical Congestion Game with Weighted Edges (GCGWE) as a general theoretical model to study this problem. In GCGWE, they view the players as vertices in a weighted graph. The amount of negative impact (e.g., congestion) caused by two close-by players to each other is determined by the weight of the edge linking them. The GCGWE unifies and significantly generalizes several simpler models considered in the previous literature, and is well suited for modeling a wide range of networking scenarios.