双边带宽拍卖博弈的供需函数均衡

H. Kebriaei, B. Maham, D. Niyato
{"title":"双边带宽拍卖博弈的供需函数均衡","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":"{\"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}","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

摘要

我们考虑一个基于蜂窝的主网络与一个辅助网络共存。主网络由多个服务提供商(SP)组成,从网络中有多个独立用户。服务提供商在不同的频谱上运行,一组辅助用户打算与主要业务共享这些频谱。这种情况被表述为带宽拍卖游戏,其中每个用户出价一条需求曲线,每个服务提供商提供一条供给曲线。我们考虑了完全信息情况和不完全信息情况或学习博弈两种情况。针对这两种情况,给出了参与人的最优策略,并给出了求解这些动态博弈的分布式算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Supply-demand function equilibrium for double sided bandwidth-auction games
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信