A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Koji Yamamoto

TL;DR
This survey reviews how potential game theory is applied to wireless networks, highlighting its properties and convergence guarantees in various channel assignment problems.
Contribution
It provides a comprehensive overview of potential game applications and properties in wireless network optimization.
Findings
Potential games ensure convergence in wireless network algorithms.
Many wireless channel assignment problems are modeled as potential games.
The survey highlights the effectiveness of potential games in network optimization.
Abstract
Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.
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.
