… game user association algorithm to further improve the network throughput by performing
multiple rounds of a matching game… number of rounds of the game increases, reaches closely …

… users’ mobility pattern and the urgency of traffic each user imposes to the network, more
efficient approaches for user association … additional information as the users’ context information…

… 4.4 Stability and Pareto Optimality In the following, we analyze the performance of distributed
iterative matching based user association approach. More specifically, we define and …

… MATCH-UA algorithm. 2) Distributed user association algorithm based on the matching game:
We now develop an algorithm to obtain a stable matching, which is one of the key solution …

… (GS) algorithm to obtain the initial user association, and then, propose to … matching process,
we introduce a coalition game combined with CRA and PC to find the final user association …

… In this paper, we formulate the user association problem as a distributed matching game
between BSs and UEs, and design a new matching algorithm to solve our optimization problem. …

… is to associate users to their preferred BSs to maximize the overall user rate both in … association.
We formulate the UL and DL user association problem as a matching game where users …

… In this paper, the mobile user association is modeled as a matching game (in the class of
coalition games). The matching theory relies on the existence of individual’s order relations {≽i}i…

… is a powerful mathematical tool for solving the association problem between … the user
association problem in this paper. There are two important conditions in the stable matching game. …

… In this paper, the mobile user association is modeled as a matching game (in the class of
coalition games). The matching theory relies on the existence of individual order relations {≽i }i…