{"title":"Supply-demand function equilibrium for double sided bandwidth-auction games","authors":"H. Kebriaei, B. Maham, D. Niyato","doi":"10.1109/WCNC.2014.6952450","DOIUrl":null,"url":null,"abstract":"We consider a cellular based primary network coexisting with a secondary network. The primary network consists of multiple service providers (SP) and there are several independent users in the secondary network. The SP are operating on the different frequency spectrum and a group of secondary users intend to share these spectrum with the primary services. This situation is formulated as a bandwidth auction game where each user bids a demand curve and each SP offers a supply curve. We consider two cases of complete information case and incomplete information case or learning games. For two cases, we derive the optimal strategies of the players and the distributed algorithms are presented to obtain the solution of these dynamic games.","PeriodicalId":220393,"journal":{"name":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2014.6952450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
We consider a cellular based primary network coexisting with a secondary network. The primary network consists of multiple service providers (SP) and there are several independent users in the secondary network. The SP are operating on the different frequency spectrum and a group of secondary users intend to share these spectrum with the primary services. This situation is formulated as a bandwidth auction game where each user bids a demand curve and each SP offers a supply curve. We consider two cases of complete information case and incomplete information case or learning games. For two cases, we derive the optimal strategies of the players and the distributed algorithms are presented to obtain the solution of these dynamic games.