3rd International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications

Research Article

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

  • @INPROCEEDINGS{10.1109/CROWNCOM.2008.4562546,
        author={Anh Tuan Hoang  and Ying-Chang  Liang},
        title={Dynamic Spectrum Allocation with Second-Price Auctions: When Time is Money},
        proceedings={3rd International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications},
        publisher={IEEE},
        proceedings_a={CROWNCOM},
        year={2008},
        month={7},
        keywords={},
        doi={10.1109/CROWNCOM.2008.4562546}
    }
    
  • Anh Tuan Hoang
    Ying-Chang Liang
    Year: 2008
    Dynamic Spectrum Allocation with Second-Price Auctions: When Time is Money
    CROWNCOM
    IEEE
    DOI: 10.1109/CROWNCOM.2008.4562546
Anh Tuan Hoang 1,*, Ying-Chang Liang1,*
  • 1: Institute for Infocomm Research - A-Star, Singapore
*Contact email: athoang@i2r.a-star.edu.sg, ycliang@i2r.a-star.edu.sg

Abstract

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.