We deal with multiple access channels in which the channel coefficients follow a quasi-static Markov process on a finite set of states. We first show how to allocate the rates in a global optimal fashion, in each state of the process. We give a sufficient condition under which the optimal rates adhere to some fairness criteria, holding in a time consistent fashion. Then, we borrow two concepts from dynamic cooperative game theory, i.e. the Time Consistent
Core and the Cooperation Maintaining sets, which measure users' satisfaction with the assigned rate. We show that the sets of rates fulfilling these properties coincide, and they also coincide with the set of global optimal rate allocations.
Dynamic rate allocation in Markovian quasi-static multiple access channels
Research Report RR-12-269
Type:
Rapport
Date:
2012-08-21
Department:
Systèmes de Communication
Eurecom Ref:
3784
Copyright:
© EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in Research Report RR-12-269 and is available at :
See also:
PERMALINK : https://www.eurecom.fr/publication/3784