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.