Dynamic Power Allocation Games in Parallel Multiple Access Channels

Details Dynamic Power Allocation Games in Parallel Multiple Access Channels Dynamic Power Allocation Games in Parallel Multiple Access Channels

2010-11-25

arxiv.org/abs/1011.5610v1

Computer Science

Computer Science and Game Theory

18 pages, 4 figures, submitted to Valuetools '11

Scientific paper

We analyze the distributed power allocation problem in parallel multiple access channels (MAC) by studying an associated non-cooperative game which admits an exact potential. Even though games of this type have been the subject of considerable study in the literature, we find that the sufficient conditions which ensure uniqueness of Nash equilibrium points typically do not hold in this context. Nonetheless, we show that the parallel MAC game admits a unique equilibrium almost surely, thus establishing an important class of counterexamples where these sufficient conditions are not necessary. Furthermore, if the network's users employ a distributed learning scheme based on the replicator dynamics, we show that they converge to equilibrium from almost any initial condition, even though users only have local information at their disposal.

Affiliated with

Also associated with

No associations

Rating

Dynamic Power Allocation Games in Parallel Multiple Access Channels 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 Dynamic Power Allocation Games in Parallel Multiple Access Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Power Allocation Games in Parallel Multiple Access Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-587892