Computer Science – Computer Science and Game Theory
Scientific paper
2010-09-25
Computer Science
Computer Science and Game Theory
In proc. of the IEEE Latin-American Conference on Communications (LATINCOM), Bogota, Colombia, September, 2010
Scientific paper
Considering the interaction through mutual interference of the different radio devices, the channel selection (CS) problem in decentralized parallel multiple access channels can be modeled by strategic-form games. Here, we show that the CS problem is a potential game (PG) and thus the fictitious play (FP) converges to a Nash equilibrium (NE) either in pure or mixed strategies. Using a 2-player 2-channel game, it is shown that convergence in mixed strategies might lead to cycles of action profiles which lead to individual spectral efficiencies (SE) which are worse than the SE at the worst NE in mixed and pure strategies. Finally, exploiting the fact that the CS problem is a PG and an aggregation game, we present a method to implement FP with local information and minimum feedback.
Lasaulce Samson
Perlaza Samir M.
Quintero-Florez V.
Tembine Hamidou
No associations
LandOfFree
On the Fictitious Play and Channel Selection Games 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 On the Fictitious Play and Channel Selection Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Fictitious Play and Channel Selection Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-696068