TY - GEN
T1 - Bargaining over fading interference channels
AU - Brehmer, Johannes
AU - Utschick, Wolfgang
PY - 2009
Y1 - 2009
N2 - We consider the problem of bargaining over block fading interference channels, where interaction between players takes place over multiple channel realizations. Based on the assumption that the transmitters have conflicting objectives, we use axiomatic bargaining theory to derive optimal rate allocations in each block. In the setup under consideration, the Nash bargaining solution (NBS) is non-causal, i.e., cannot be implemented in a real-world system. We argue that the invariance axiom is superfluous when bargaining over a rate region. Without the invariance axiom, an equivalent solution follows from the maximization of a sum of utilities under minimum utility constraints. This alternative solution is also non-causal. We propose causal approximations to the optimal solutions. The sum utility solution allows for a more systematic approximation than the NBS. Thus, dropping the invariance axiom makes it possible to choose a solution which can be better approximated. We provide numerical results to illustrate the performance of the proposed solutions.
AB - We consider the problem of bargaining over block fading interference channels, where interaction between players takes place over multiple channel realizations. Based on the assumption that the transmitters have conflicting objectives, we use axiomatic bargaining theory to derive optimal rate allocations in each block. In the setup under consideration, the Nash bargaining solution (NBS) is non-causal, i.e., cannot be implemented in a real-world system. We argue that the invariance axiom is superfluous when bargaining over a rate region. Without the invariance axiom, an equivalent solution follows from the maximization of a sum of utilities under minimum utility constraints. This alternative solution is also non-causal. We propose causal approximations to the optimal solutions. The sum utility solution allows for a more systematic approximation than the NBS. Thus, dropping the invariance axiom makes it possible to choose a solution which can be better approximated. We provide numerical results to illustrate the performance of the proposed solutions.
UR - https://www.scopus.com/pages/publications/74349089416
U2 - 10.4108/ICST.WIOPT2009.6371
DO - 10.4108/ICST.WIOPT2009.6371
M3 - Conference contribution
AN - SCOPUS:74349089416
SN - 9781424449200
T3 - Final Proceedings of the 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2009
BT - Final Proceedings of the 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2009
T2 - 2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2009
Y2 - 23 June 2009 through 27 June 2009
ER -