Download now Free registration required
The authors address the power allocation problem for interference relay channels. Due to the competitive nature of the multi-user environment, they model the problem as a strategic non-cooperative game and show that this game always has a unique Nash Equilibrium (NE), for any system profile. Two iterative algorithms, based on sequential and simultaneous updating, are proposed to achieve the unique NE in a distributed manner. They shall also prove that both algorithms always converge to the unique NE, from an arbitrary starting point.
- Format: PDF
- Size: 197.5 KB