Game-theoretic resource allocation in relay-assisted DS/CDMA systems with successive interference cancellation

The problem of non-cooperative resource allocation in an amplifyand-forward relay-assisted DS/CDMA system is addressed. The relay designs its amplify-and-forward matrix for achievable sum-rate maximization, whereas the multiple access users pursue individual achievable rate maximization. The interaction between the relay and the multiple access users has been modeled as a Stackelberg game, with the relay as the leader and the multiple access users as followers. Numerical results are provided to show the merits of the proposed algorithm.

• Type: Journal
• Year: 2011
• Where: ICASSP
• Authors: Alessio Zappone, Eduard A. Jorswieck
• Keywords: Achievable Rate Maximization, Achievable Sum-rate Maximization, ICASSP 2011, Multiple Access Users, Signal Processing