Auction-based scheduling in non-cooperative multiuser OFDM systems

We study the problem of achieving proportional fair resource allocation in a non-cooperative multiuser OFDM network. We propose an auction-based scheduling algorithm, which combines the merits of the VCG auction and the greedy MC PF algorithm, to ensure that wireless users truthfully declare their resource requirements even though the users are inherently selfish. Through simulations, we find that users lying about their resource requirements are severely penalized by very high payments so that they should rather declare true valuations of subcarriers to the scheduler. Thus, the proposed auction-based scheduling algorithm can be used efficiently in a non-cooperative situation to realize proportional fairness.