Distributed resource allocation in cognitive radio networks with a game learning approach to improve aggregate system capacity
J.R. Gallego, M. Canales, J. Ortin

TL;DR
This paper introduces a game-theoretic, distributed approach for joint channel allocation and power control in cognitive radio networks, utilizing no-regret learning algorithms to enhance system capacity and adaptability.
Contribution
It proposes a novel distributed solution using game theory and no-regret learning for joint resource allocation in cognitive radio networks, improving over existing centralized methods.
Findings
High probability of pure Nash Equilibrium existence
Performance comparable to centralized genetic algorithms
Enhanced stability and global performance with no-regret learning
Abstract
This paper presents a game theoretic solution for joint channel allocation and power control in cognitive radio networks analyzed under the physical interference model. The objective is to find a distributed solution that maximizes the network utility, defined with different criteria, with limited information. The problem is addressed through a non-cooperative game based on local information. Although the existence of a pure Nash Equilibrium cannot be assured for this game, simulation results show that it exists with high probability and with a performance similar to that of a potential game, where each player requires overall network information. The obtained results are compared with a centralized heuristic genetic algorithm to show the correctness of the proposals. From this point, utility functions for the local game are modified to restrict the transmitted power to drive the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
