Fairness vs. Efficiency: Comparison of Game Theoretic Criteria for OFDMA Scheduling

The four most important game theoretic solutions for cooperative bargaining are applied as OFDMA schedulers and simulatively compared in two scenarios with respect to sum throughput, per user throughput, frequency band sharing and scaling with the number of users. Scheduling according to the Kalai-Smorodinsky solution turns out to be an alternative to proportional fairness (Nash solution), both offer a compromise between efficiency and fairness.

[1]  Holger Boche,et al.  Optimization-Theoretic Analysis of Stability-Optimal Transmission Policy for Multiple-Antenna Multiple-Access Channel , 2007, IEEE Transactions on Signal Processing.

[2]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[3]  Christos Douligeris,et al.  Fairness in network optimal flow control: optimality of product forms , 1991, IEEE Trans. Commun..

[4]  M. Schubert,et al.  Properties and operational characterization of proportionally fair resource allocation , 2007, 2007 IEEE 8th Workshop on Signal Processing Advances in Wireless Communications.

[5]  A. Jalali,et al.  Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[6]  Mihaela van der Schaar,et al.  Fairness Strategies for Multi-user Multimedia Applications in Competitive Environments using the Kalai-Smorodinsky Bargaining Solution , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[7]  W. Thomson.  Chapter 35 Cooperative models of bargaining , 1994 .

[8]  Hoon Kim,et al.  A proportional fair scheduling for multicarrier transmission systems , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.