Groupon in the Air: A three-stage auction framework for Spectrum Group-buying

P. Lin, Xiaojun Feng, Qian Zhang, M. Hamdi
{"title":"Groupon in the Air: A three-stage auction framework for Spectrum Group-buying","authors":"P. Lin, Xiaojun Feng, Qian Zhang, M. Hamdi","doi":"10.1109/INFCOM.2013.6567002","DOIUrl":null,"url":null,"abstract":"Spectrum auction is widely applied in spectrum redistributions, especially under the dynamic spectrum management context. However, due to the high price asked by the spectrum holders, secondary users (SUs) with limited budget cannot benefit from such auction directly. Motivated by the recent group-buying behaviors in the Internet based service, we advocate that SUs can be grouped together to take part in the spectrum auction as a whole to increase their chances to win the channel. The cost and benefit of the won spectrum are then shared evenly among the SUs within the group. None of the existing auction models can be applied in this scenario due to three unique challenges: how can a group leader select the winning SUs and charge them fairly and efficiently; how to guarantee truthfulness of users' bids; how to match the heterogeneous channels to groups when one group would like to buy at most one channel. In this paper, we propose TASG, a Three-stage Auction framework for Spectrum Group-buying to address the above challenges and enable group-buying behaviors among SUs. In the first stage, we propose an algorithm to decide the group members and bids for the channels. In the second stage, we conduct auction between the group leaders and the spectrum holder, with a novel winner determination algorithm. In the third stage, the group leaders further distribute spectrum and bills to the SUs in the group. TASG possesses good properties such as truthfulness, individual rationality, improved system efficiency, and computational tractability.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"22 8","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"61","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Proceedings IEEE INFOCOM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2013.6567002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 61

Abstract

Spectrum auction is widely applied in spectrum redistributions, especially under the dynamic spectrum management context. However, due to the high price asked by the spectrum holders, secondary users (SUs) with limited budget cannot benefit from such auction directly. Motivated by the recent group-buying behaviors in the Internet based service, we advocate that SUs can be grouped together to take part in the spectrum auction as a whole to increase their chances to win the channel. The cost and benefit of the won spectrum are then shared evenly among the SUs within the group. None of the existing auction models can be applied in this scenario due to three unique challenges: how can a group leader select the winning SUs and charge them fairly and efficiently; how to guarantee truthfulness of users' bids; how to match the heterogeneous channels to groups when one group would like to buy at most one channel. In this paper, we propose TASG, a Three-stage Auction framework for Spectrum Group-buying to address the above challenges and enable group-buying behaviors among SUs. In the first stage, we propose an algorithm to decide the group members and bids for the channels. In the second stage, we conduct auction between the group leaders and the spectrum holder, with a novel winner determination algorithm. In the third stage, the group leaders further distribute spectrum and bills to the SUs in the group. TASG possesses good properties such as truthfulness, individual rationality, improved system efficiency, and computational tractability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
空中团购:频谱团购的三阶段拍卖框架
频谱拍卖在频谱再分配中有着广泛的应用,特别是在动态频谱管理环境下。然而,由于频谱持有人要求的价格很高,预算有限的二级用户无法直接从这种拍卖中受益。鉴于最近互联网服务的团购行为,我们提倡将网络服务供应商集合在一起,整体参与频谱拍卖,以增加他们赢得频谱的机会。然后,韩元频谱的成本和收益由集团内的单个单位平均分担。由于三个独特的挑战,现有的拍卖模式都不能适用于这种情况:集团领导如何选择获胜的SUs并公平有效地收取费用;如何保证用户报价的真实性;当一个群体最多只购买一个渠道时,如何将异构渠道与群体进行匹配。在本文中,我们提出了TASG,一种用于频谱团购的三阶段拍卖框架,以解决上述挑战并实现su之间的团购行为。在第一阶段,我们提出了一种算法来确定群组成员和通道的出价。在第二阶段,我们用一种新的获胜者确定算法在群领导和频谱持有者之间进行拍卖。在第三阶段,组领导进一步将频谱和账单分配给组内的su。TASG算法具有真实性、个体合理性、提高系统效率和计算可追溯性等优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
VoteTrust: Leveraging friend invitation graph to defend against social network Sybils Groupon in the Air: A three-stage auction framework for Spectrum Group-buying Into the Moana1 — Hypergraph-based network layer indirection Prometheus: Privacy-aware data retrieval on hybrid cloud Adaptive device-free passive localization coping with dynamic target speed
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1