Stackelberg Contention Games in Multiuser Networks

Computer Science – Computer Science and Game Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

30 pages, 5 figures

Scientific paper

10.1155/2009/305978

Interactions among selfish users sharing a common transmission channel can be modeled as a non-cooperative 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 non-cooperative 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Stackelberg Contention Games in Multiuser Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stackelberg Contention Games in Multiuser Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stackelberg Contention Games in Multiuser Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-541632

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.