A Novel Auction Algorithm for Fair Allocation of A Wireless Fading Channel

We develop a novel auction-based algorithm to allow users to fairly compete for a wireless fading channel. We use the all-pay auction mechanism whereby user bid for the channel, during each time-slot, based on the fade state of the channel, and the user that makes the higher bid wins use of the channel. Under the assumption that each user has a limited budget for bidding, we show the existence of a unique Nash equilibrium strategy. We show that the strategy achieves a throughput allocation for each user that is proportional to the user’s budget and establish that the aggregate throughput received by the users using the Nash equilibrium strategy is at least 3/4 of what can be obtained using an optimal centralized allocation scheme that does not take fairness into account.

[1]  T. Palfrey.  Multiple-Object, Discriminatory Auctions with Bidding Constraints: A Game-Theoretic Analysis , 1980 .

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

[3]  Ian L. Gale,et al.  Standard Auctions with Financially Constrained Bidders , 1998 .

[4]  Rene L. Cruz,et al.  Transmission Policies for Time Varying Channels with Average Delay Constraints , 1999 .

[5]  P. Klemperer.  Auction Theory: A Guide to the Literature , 1999 .

[6]  Ness B. Shroff,et al.  Opportunistic transmission scheduling with resource-sharing constraints in wireless networks , 2001, IEEE J. Sel. Areas Commun..

[7]  Elif Uysal-Biyikoglu,et al.  Energy-efficient transmission over a wireless link via lazy packet scheduling , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  R. Srikant,et al.  Revenue-maximizing pricing and capacity expansion in a many-users regime , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[10]  Peter Marbach,et al.  Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Peter Marbach,et al.  Downlink resource allocation and pricing for wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  D. Goodman,et al.  A New Framework for Power Control in Wireless Data Networks: Games, Utility, and Pricing , 2002 .

[13]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Eytan Modiano,et al.  Optimal energy allocation for delay-constrained data transmission over a time-varying channel , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  R. Johari,et al.  Network resource allocation and a congestion game: the single link case , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).