Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

A Comprehensive Survey of Potential Game Approaches to Wireless Networks

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.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on Communications, vol. E98-B, no. 9, Sept. 201

Distributed power allocation for D2D communications underlaying/overlaying OFDMA cellular networks

The implementation of device-to-device (D2D) underlaying or overlaying pre-existing cellular networks has received much attention due to the potential of enhancing the total cell throughput, reducing power consumption and increasing the instantaneous data rate. In this paper we propose a distributed power allocation scheme for D2D OFDMA communications and, in particular, we consider the two operating modes amenable to a distributed implementation: dedicated and reuse modes. The proposed schemes address the problem of maximizing the users' sum rate subject to power constraints, which is known to be nonconvex and, as such, extremely difficult to be solved exactly. We propose here a fresh approach to this well-known problem, capitalizing on the fact that the power allocation problem can be modeled as a potential game. Exploiting the potential games property of converging under better response dynamics, we propose two fully distributed iterative algorithms, one for each operation mode considered, where each user updates sequentially and autonomously its power allocation. Numerical results, computed for several different user scenarios, show that the proposed methods, which converge to one of the local maxima of the objective function, exhibit performance close to the maximum achievable optimum and outperform other schemes presented in the literature