{"title":"自适应:一种具有时变值的频谱共享动态索引拍卖","authors":"M. Khaledi, A. Abouzeid","doi":"10.1109/WIOPT.2014.6850340","DOIUrl":null,"url":null,"abstract":"Spectrum auction is considered a suitable approach to efficiently allocate spectrum among unlicensed users. In a typical spectrum auction, Secondary Users (SUs) bid to buy spectrum bands from a Primary Owner (PO) who acts as the auctioneer. Existing spectrum auctions assume that SUs have static and known values for the channels. However, in many real world settings, SUs do not know the exact value of channel access at first, but they learn it over time. In this paper, we study spectrum auctions in a dynamic setting where SUs can change their valuations based on their experiences with the channel. We propose ADAPTIVE, a dynAmic inDex Auction for sPectrum sharing with TIme-evolving ValuEs that maximizes the social welfare of the SUs. ADAPTIVE is based on multi-armed bandit models where for each user an allocation index is independently calculated in polynomial time. ADAPTIVE has some desired economic properties that are formally proven in the analysis. Also, we provide a numerical performance comparison between ADAPTIVE and the well known Vickrey second price auction as a representative of static auctions.","PeriodicalId":381489,"journal":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"ADAPTIVE: A Dynamic Index Auction for Spectrum sharing with Time-evolving Values\",\"authors\":\"M. Khaledi, A. Abouzeid\",\"doi\":\"10.1109/WIOPT.2014.6850340\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Spectrum auction is considered a suitable approach to efficiently allocate spectrum among unlicensed users. In a typical spectrum auction, Secondary Users (SUs) bid to buy spectrum bands from a Primary Owner (PO) who acts as the auctioneer. Existing spectrum auctions assume that SUs have static and known values for the channels. However, in many real world settings, SUs do not know the exact value of channel access at first, but they learn it over time. In this paper, we study spectrum auctions in a dynamic setting where SUs can change their valuations based on their experiences with the channel. We propose ADAPTIVE, a dynAmic inDex Auction for sPectrum sharing with TIme-evolving ValuEs that maximizes the social welfare of the SUs. ADAPTIVE is based on multi-armed bandit models where for each user an allocation index is independently calculated in polynomial time. ADAPTIVE has some desired economic properties that are formally proven in the analysis. Also, we provide a numerical performance comparison between ADAPTIVE and the well known Vickrey second price auction as a representative of static auctions.\",\"PeriodicalId\":381489,\"journal\":{\"name\":\"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIOPT.2014.6850340\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIOPT.2014.6850340","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ADAPTIVE: A Dynamic Index Auction for Spectrum sharing with Time-evolving Values
Spectrum auction is considered a suitable approach to efficiently allocate spectrum among unlicensed users. In a typical spectrum auction, Secondary Users (SUs) bid to buy spectrum bands from a Primary Owner (PO) who acts as the auctioneer. Existing spectrum auctions assume that SUs have static and known values for the channels. However, in many real world settings, SUs do not know the exact value of channel access at first, but they learn it over time. In this paper, we study spectrum auctions in a dynamic setting where SUs can change their valuations based on their experiences with the channel. We propose ADAPTIVE, a dynAmic inDex Auction for sPectrum sharing with TIme-evolving ValuEs that maximizes the social welfare of the SUs. ADAPTIVE is based on multi-armed bandit models where for each user an allocation index is independently calculated in polynomial time. ADAPTIVE has some desired economic properties that are formally proven in the analysis. Also, we provide a numerical performance comparison between ADAPTIVE and the well known Vickrey second price auction as a representative of static auctions.