自适应:一种具有时变值的频谱共享动态索引拍卖

M. Khaledi, A. Abouzeid
{"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}
引用次数: 9

摘要

频谱拍卖被认为是有效分配频谱给无牌用户的合适方法。在典型的频谱拍卖中,二级用户(su)向主拥有人(PO)出价购买频谱。主拥有人担任拍卖人。现有的频谱拍卖假设单元具有静态和已知的信道值。然而,在许多现实世界的设置中,su一开始并不知道通道访问的确切价值,但随着时间的推移他们会了解它。在本文中,我们研究了一个动态环境下的频谱拍卖,在这个环境下,运营商可以根据他们的渠道经验改变他们的估值。我们提出了一种具有时间演化价值的频谱共享动态索引拍卖自适应算法,该算法能使SUs的社会福利最大化。ADAPTIVE基于多臂强盗模型,在多项式时间内对每个用户独立计算分配指标。ADAPTIVE具有一些理想的经济性质,并在分析中得到了正式证明。此外,我们还提供了ADAPTIVE与作为静态拍卖代表的著名的Vickrey第二价格拍卖之间的数值性能比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信