# A Comprehensive Survey of Potential Game Approaches to Wireless Networks

arXiv: https://arxiv.org/abs/1506.07942 · HTML: https://mlsanity.com/paper/1506.07942/

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Jun 2015.

## Built on by (most cited first, 7 of 7)

- [Provably Learning Nash Policies in Constrained Markov Potential Games](https://mlsanity.com/paper/2306.07749/) (2023)
- [Gradient-based Learning in State-based Potential Games for Self-Learning Production Systems](https://mlsanity.com/paper/2406.10015/) (2024)
- [Self-optimization in distributed manufacturing systems using Modular State-based Stackelberg Games](https://mlsanity.com/paper/2410.22912/) (2024)
- [Dynamic Partial Computation Offloading for the Metaverse in In-Network Computing](https://mlsanity.com/paper/2306.06022/) (2023)
- [Distributed Stackelberg Strategies in State-based Potential Games for Autonomous Decentralized Learning Manufacturing Systems](https://mlsanity.com/paper/2408.06397/) (2024)
- [Transfer learning of state-based potential games for process optimization in decentralized manufacturing systems](https://mlsanity.com/paper/2408.05992/) (2024)
- [Real Time Self-Tuning Adaptive Controllers on Temperature Control Loops using Event-based Game Theory](https://mlsanity.com/paper/2506.13164/) (2025)

## Abstract (arXiv)

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.
