Bargaining over fading interference channels

J. Brehmer, W. Utschick
{"title":"Bargaining over fading interference channels","authors":"J. Brehmer, W. Utschick","doi":"10.1109/WIOPT.2009.5291614","DOIUrl":null,"url":null,"abstract":"We consider the problem of bargaining over block fading interference channels, where interaction between players takes place over multiple channel realizations. Based on the assumption that the transmitters have conflicting objectives, we use axiomatic bargaining theory to derive optimal rate allocations in each block. In the setup under consideration, the Nash bargaining solution (NBS) is non-causal, i.e., cannot be implemented in a real-world system. We argue that the invariance axiom is superfluous when bargaining over a rate region. Without the invariance axiom, an equivalent solution follows from the maximization of a sum of utilities under minimum utility constraints. This alternative solution is also non-causal. We propose causal approximations to the optimal solutions. The sum utility solution allows for a more systematic approximation than the NBS. Thus, dropping the invariance axiom makes it possible to choose a solution which can be better approximated. We provide numerical results to illustrate the performance of the proposed solutions.","PeriodicalId":143632,"journal":{"name":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIOPT.2009.5291614","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

We consider the problem of bargaining over block fading interference channels, where interaction between players takes place over multiple channel realizations. Based on the assumption that the transmitters have conflicting objectives, we use axiomatic bargaining theory to derive optimal rate allocations in each block. In the setup under consideration, the Nash bargaining solution (NBS) is non-causal, i.e., cannot be implemented in a real-world system. We argue that the invariance axiom is superfluous when bargaining over a rate region. Without the invariance axiom, an equivalent solution follows from the maximization of a sum of utilities under minimum utility constraints. This alternative solution is also non-causal. We propose causal approximations to the optimal solutions. The sum utility solution allows for a more systematic approximation than the NBS. Thus, dropping the invariance axiom makes it possible to choose a solution which can be better approximated. We provide numerical results to illustrate the performance of the proposed solutions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在衰落干扰信道上讨价还价
我们考虑在块衰落干扰信道上讨价还价的问题,其中参与者之间的交互发生在多个信道实现上。基于发射机目标冲突的假设,我们使用公理议价理论推导出每个区块的最优费率分配。在考虑的设置中,纳什议价解决方案(NBS)是非因果的,即不能在现实世界系统中实现。我们论证了在速率域上讨价还价时不变性公理是多余的。在没有不变性公理的情况下,从最小效用约束下效用和的最大化得到一个等价解。这种替代解决方案也是非因果的。我们提出了最优解的因果近似。与国家统计局相比,总和效用解决方案允许更系统的近似。因此,放弃不变性公理使得选择一个可以更好地近似的解成为可能。我们提供了数值结果来说明所提出的解决方案的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Joint load balancing, scheduling, and interference mitigation in multi-cell and multi-carrier wireless data systems Transmission schedule optimization for half-duplex multiple-relay networks Quantization, channel compensation, and energy allocation for estimation in wireless sensor networks Characterization of power consumption in thin clients due to protocol data transmission over IEEE 802.11 Battery recovery aware sensor networks
×
引用
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