Non-atomic Games for Multi-User Systems

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 4 figures, submitted to IEEE JSAC Special Issue on ``Game Theory in Communication Systems''

Scientific paper

In this contribution, the performance of a multi-user system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is assumed at the base station). We consider the realistic case of frequency selective channels for uplink CDMA. This scenario illustrates the case of decentralized schemes, where limited information on the network is available at the terminal. Various receivers are considered, namely the Matched filter, the MMSE filter and the optimum filter. The goal of this paper is to derive simple expressions for the non-cooperative Nash equilibrium as the number of mobiles becomes large and the spreading length increases. To that end two asymptotic methodologies are combined. The first is asymptotic random matrix theory which allows us to obtain explicit expressions of the impact of all other mobiles on any given tagged mobile. The second is the theory of non-atomic games which computes good approximations of the Nash equilibrium as the number of mobiles grows.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Non-atomic Games for Multi-User Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Non-atomic Games for Multi-User Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-atomic Games for Multi-User Systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-143933

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.