A Fully Distributed Algorithm for Dynamic Channel Adaptation in Canonical Communication Networks

In this letter, a low-complexity, fully distributed algorithm is designed for dynamic channel adaptation in a canonical communication network, where each player can independently update its action without any information exchange. Both the static and dynamic channel environments are studied. The proposed algorithm converges to a set of correlated equilibria with probability one. Moreover, the optimality property of the problem is analyzed. Simulation results demonstrate that the proposed algorithm achieves a near-optimal performance for interference mitigation.