{"title":"The Gaussian interference channel revisited as a non-cooperative game with transmission cost","authors":"M. Fasoulakis, A. Traganitis, A. Ephremides","doi":"10.23919/WIOPT.2017.7959910","DOIUrl":null,"url":null,"abstract":"We consider the Gaussian interference channel as a non-cooperative game taking into account the cost of the transmission. We study the conditions of the existence of a pure Nash equilibrium. Particularly, for the many-user case we give sufficient conditions that lead to a Nash equilibrium, and for the two-user case we exhaustively describe the conditions of the existence and the uniqueness of a pure Nash equilibrium and we show the existence of best-response dynamics that converge to one of them.","PeriodicalId":6630,"journal":{"name":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/WIOPT.2017.7959910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
We consider the Gaussian interference channel as a non-cooperative game taking into account the cost of the transmission. We study the conditions of the existence of a pure Nash equilibrium. Particularly, for the many-user case we give sufficient conditions that lead to a Nash equilibrium, and for the two-user case we exhaustively describe the conditions of the existence and the uniqueness of a pure Nash equilibrium and we show the existence of best-response dynamics that converge to one of them.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
