{"title":"基于平滑超模博弈的认知无线网络频谱共享","authors":"Huili Cheng, Qinghai Yang, Fenglin Fu, K. Kwak","doi":"10.1109/ISCIT.2011.6092168","DOIUrl":null,"url":null,"abstract":"In this paper, a supermodular game theoretic approach is investigated for spectrum sharing in cognitive radio networks. We consider a Bertrand competition model, in which primary service providers compete to sell their spare spectrum and then to maximize their individual profits. We demonstrate that the Bertrand competition is a smooth supermodular game, and a round-robin optimization algorithm is developed to obtain the optimal price solutions. Simulation results verify that the algorithm approximately converges to an equilibrium point, and the influence of the exogenous variable on the equilibrium point is analyzed.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Spectrum sharing with smooth supermodular game in cognitive radio networks\",\"authors\":\"Huili Cheng, Qinghai Yang, Fenglin Fu, K. Kwak\",\"doi\":\"10.1109/ISCIT.2011.6092168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a supermodular game theoretic approach is investigated for spectrum sharing in cognitive radio networks. We consider a Bertrand competition model, in which primary service providers compete to sell their spare spectrum and then to maximize their individual profits. We demonstrate that the Bertrand competition is a smooth supermodular game, and a round-robin optimization algorithm is developed to obtain the optimal price solutions. Simulation results verify that the algorithm approximately converges to an equilibrium point, and the influence of the exogenous variable on the equilibrium point is analyzed.\",\"PeriodicalId\":226552,\"journal\":{\"name\":\"2011 11th International Symposium on Communications & Information Technologies (ISCIT)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 11th International Symposium on Communications & Information Technologies (ISCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCIT.2011.6092168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCIT.2011.6092168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Spectrum sharing with smooth supermodular game in cognitive radio networks
In this paper, a supermodular game theoretic approach is investigated for spectrum sharing in cognitive radio networks. We consider a Bertrand competition model, in which primary service providers compete to sell their spare spectrum and then to maximize their individual profits. We demonstrate that the Bertrand competition is a smooth supermodular game, and a round-robin optimization algorithm is developed to obtain the optimal price solutions. Simulation results verify that the algorithm approximately converges to an equilibrium point, and the influence of the exogenous variable on the equilibrium point is analyzed.