Department Gathering

Graphical Congestion Games with Applications in Spectrum Sharing

Abstract (Invited Talk)

The classical congestion game (introduced by Rosenthal in 1973) nicely captures the interactions between selfish players competing for limited resources, and has found many applications in economics, communications, networking, ecology, and sociology. However, such model does not capture the spatial relationships between players, which are critical for many applications. This motivates the study of graphical congestion game, which models the spatial relationships by a graph. In this talk, we will discuss several recent results on graphical congestion games, focusing on those with player-specific and resource-specific payoff functions on weighted directed graphs. We will also discuss how these models can help us to understand dynamic spectrum sharing in distributed wireless networks.

Back