Skip to main content

Stackelberg Contention Games in Multiuser Networks

Abstract

Interactions among selfish users sharing a common transmission channel can be modeled as a noncooperative game using the game theory framework. When selfish users choose their transmission probabilities independently without any coordination mechanism, Nash equilibria usually result in a network collapse. We propose a methodology that transforms the noncooperative game into a Stackelberg game. Stackelberg equilibria of the Stackelberg game can overcome the deficiency of the Nash equilibria of the original game. A particular type of Stackelberg intervention is constructed to show that any positive payoff profile feasible with independent transmission probabilities can be achieved as a Stackelberg equilibrium payoff profile. We discuss criteria to select an operating point of the network and informational requirements for the Stackelberg game. We relax the requirements and examine the effects of relaxation on performance.

Publisher note

To access the full article, please see PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jaeok Park.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Park, J., van der Schaar, M. Stackelberg Contention Games in Multiuser Networks. EURASIP J. Adv. Signal Process. 2009, 305978 (2009). https://doi.org/10.1155/2009/305978

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1155/2009/305978

Keywords

  • Nash Equilibrium
  • Transmission Probability
  • Coordination Mechanism
  • Transmission Channel
  • Positive Payoff