Evolutionary games for dynamic network resource selection in RSMA-enabled 6G networks

Abstract

In this paper, we address a dynamic network resource selection problem for mobile users in a rate-splitting multiple access (RSMA)-enabled network by leveraging evolutionary games. Particularly, mobile users are able to locally and dynamically make their selection on orthogonal resource blocks (RBs), which are also considered as network resources (NRs), over time to achieve their desired utilities. Then, RSMA is used for each group of users selecting the same NR. With the use of RSMA, the main goal is to optimize the beamformers of the common and private messages for users in the same group to maximize their sum rate. The resulting problem is generally non-convex, and thus we develop a successive convex approximation (SCA)-based algorithm to efficiently solve it in an iterative fashion. To model the NR adaptation of users, we propose to use two evolutionary games, i.e., a traditional evolutionary game (TEG) and fractional evolutionary game (FEG). The FEG approach enables users to incorporate memory effects (i.e., their past experiences) for their decision-making, which is more realistic than the TEG approach. We then theoretically verify the existence of the equilibrium of the proposed game approaches. Simulation results are provided to validate their consistency with the theoretical analysis and merits of the proposed approaches. They also reveal that, compared with TEG, FEG enables users to leverage past information for their decision-making, resulting in less communication overhead, while still guaranteeing convergence.