In this paper, we proposed and illustrated a distributed low-complex algorithm for precoding strategy selection in a multiuser Multiple-input Multiple-output (MU-MIMO) wireless system using noncooperative games. We formulate the game as a non-cooperative game for an asynchronous distributed system in multiuser MIMO system known as Partially asynchronous distributed algorithm (PADA) and the convergence (Nash Equilibrium (NE) point) of the game. Mathematical framework providing sufficient conditions guaranteeing the uniqueness of the NE and the convergence of the proposed algorithm is presented. (NE) which possess at least one pure strategy Nash equilibrium (NE) and the optimal strategy profile which maximizes the sum rate provides the solution for the existence and uniqueness of the game. The main focus is on non-cooperation of interference multiuser MIMO channel. Analysis of the proposed partially asynchronous distributed low-complex algorithm for precoding strategy selection in a multiuser MIMO wireless system using non-cooperative games is illustrated.

No abstract

Resource allocation among multiple users interference channel has posed significant issues in cooperative communication networks. A game-theoretic approach is studied under spectral mask constraints (SMCs) in cooperative relay networks using Amplify-and-Forward as a relaying protocol. The cooperative strategy employed as game-theoretic approach is based on the Nash bargaining solution (NBS). The Nash equilibrium and Nash bargaining solutions are derived for a two-player game based on the joint time division multiplexing and frequency division multiplexing (TDM/FDM) as a mode of cooperation.The condition for the uniqueness and existence of the NBS is derived.