Dynamic Spectrum Allocation with Second-Price Auctions: When Time is Money

We consider a dynamic spectrum access scenario in which transmission opportunities are allocated to users based on a second price, sealed bid auction. Each user experiences a time-varying channel and submits a bid for transmission right in each time slot. A base station collects bids from all users and allocates the channel to a user with the highest bid, who then pays the price equal the second highest bid. The distinctive feature of our model is that it treats time as money and allows each user to bid and to pay for the transmission rights using his/her own communication time. For each time slot, the value of a bid submitted by each user is equal the amount of time he/she promises to forfeit to the base station for the right to transmit during the remaining of the time slot. That means the base station collects part of each time slot from the winning user for its own usage and allocates the rest to the winning user. Users can vary their bids based on their channel conditions, subject to constraints on average budgets. From the users' point of view, we show that there exists Nash equilibrium bidding strategies in the two-user case. From the base station's point of view, we investigate how average budget constraints should be set to balance between base station's revenue and users' satisfaction.

[1]  N. Mandayam,et al.  Demand responsive pricing and competitive spectrum allocation via a spectrum server , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[2]  Jaime F. Zender,et al.  Auctioning divisible goods , 2002 .

[3]  Haitao Zheng,et al.  A General Framework for Wireless Spectrum Auctions , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[4]  S. Kakutani.  A generalization of Brouwer’s fixed point theorem , 1941 .

[5]  J. yon Neumann.  A GENERALIZATION OF BROUWERS FIXED POINT THEOREM BY SHIZUO IAKUTANI , .

[6]  F. Jondral,et al.  Dynamic and local combined pricing, allocation and billing system with cognitive radios , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[7]  N. Amitay,et al.  Resource auction multiple access (rama) : efficient method for fast resource assignment in decentralised wireless PCS , 1992 .

[8]  Eytan Modiano,et al.  Wireless channel allocation using an auction algorithm , 2006, IEEE Journal on Selected Areas in Communications.

[9]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[10]  John N. Tsitsiklis,et al.  Efficiency loss in a network resource allocation game: the case of elastic supply , 2005, IEEE Trans. Autom. Control..

[11]  Michael L. Honig,et al.  Auction-Based Spectrum Sharing , 2006, Mob. Networks Appl..

[12]  J. Nash,et al.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[13]  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.

[14]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..