Congestion games with resource reuse and applications in spectrum sharing

Abstract

In this paper we consider an extension to the classical definition of congestion games (CG) in which multiple users share the same set of resources and their payoff for using any resource is a function of the total number of users sharing it. The classical congestion games enjoy some very appealing properties, including the existence of a Nash equilibrium and that every improvement path is finite and leads to such a NE (also called the finite improvement property or FIP), which is also a local optimum to a potential function. On the other hand, this class of games does not model well the congestion or resource sharing in a wireless context, a prominent feature of which is spatial reuse. What this translates to in the context of a congestion game is that a user's payoff for using a resource (interpreted as a channel) is a function of the its number of its interfering users sharing that channel, rather than the total number among all users. This makes the problem quite different. We will call this the congestion game with resource reuse (CG-RR). In this paper we study intrinsic properties of such a game; in particular, we seek to address under what conditions on the underlying network this game possesses the FIP or NE. We also discuss the implications of these results when applied to wireless spectrum sharing.

Adaptive channel recommendation for dynamic spectrum access

“…which leads to (9) and (10). Due to the concavity of the optimization problem in (12), the solution is also the global optimum for the random policy generation updating.…”

“…Then the updates in (9) and (10) are replaced by the sample average version in (16) and (17), respectively. As a summary, we describe the MARS-based algorithm for finding the optimal spectrum access policy of adaptive channel recommendation MDP in Algorithm 1.…”

“…Southwell and Huang in [9] studied the largest and smallest convergence time to an equilibrium when secondary users access multiple channels in a distributed fashion. Liu et al in [10] modeled the interactions among spatially separated users as congestion games with resource reuse. Li and Han in [11] applied the graphic game theory to address the spectrum access problem with limited range of mutual interference.…”

Power allocation and spectrum sharing in multi-user, multi-channel systems with strategic users

“…These rules along with the cognitive radio's features and the fact that information in the wireless network is decentralized and users may be strategic give rise to a wealth of important and challenging research issues associated with power allocation and spectrum sharing. These issues have recently attracted a lot of interest ( [2], [6], [9] and [15]; a more detailed discussion of these references and their comparison with the results of this paper will be presented in section VI).…”

Femtocells sharing management using mobility prediction model

“…Using potential games properties is a classical method to prove the existence of a NE and that every improvement path is finite and leads to such a NE which is also a local optimum to a potential function. This property has been used in [15] for congestion game with resource reuse in a wireless context, in [22] for a real-time spectrum sharing problem with QoS provisioning and in [1] for spectrum sharing problem considered as a congestion game. The approach [13] we consider in this paper is based on a decentralized learning algorithm defined in [19].…”