一种通用的多公平算法及其在无线信道分配中的应用

M. Köppen, Kaori Yoshida, M. Tsuru
{"title":"一种通用的多公平算法及其在无线信道分配中的应用","authors":"M. Köppen, Kaori Yoshida, M. Tsuru","doi":"10.1109/INCoS.2011.23","DOIUrl":null,"url":null,"abstract":"In this paper we provide an extension of maxmin fairness to the case of multiple objectives and different agent preferences by the definition of the maxmin multi-fairness relation. This generic relation is based on a formal modification of maxmin fairness according to its implicit comparisons and includes maxmin fairness as a special case. The application of this multi-fairness relation to a selfish, to a collaborative and to a mixed community of agents is presented, as well as a case study on a specific task of fair division of indivisible goods by numerical simulations. All studies demonstrate the suitability of the proposed relation for investigative tasks in shared resource problems, as they are abundant in network design and control.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Generic Approach to Multi-fairness and Its Application to Wireless Channel Allocation\",\"authors\":\"M. Köppen, Kaori Yoshida, M. Tsuru\",\"doi\":\"10.1109/INCoS.2011.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we provide an extension of maxmin fairness to the case of multiple objectives and different agent preferences by the definition of the maxmin multi-fairness relation. This generic relation is based on a formal modification of maxmin fairness according to its implicit comparisons and includes maxmin fairness as a special case. The application of this multi-fairness relation to a selfish, to a collaborative and to a mixed community of agents is presented, as well as a case study on a specific task of fair division of indivisible goods by numerical simulations. All studies demonstrate the suitability of the proposed relation for investigative tasks in shared resource problems, as they are abundant in network design and control.\",\"PeriodicalId\":235301,\"journal\":{\"name\":\"2011 Third International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Third International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCoS.2011.23\",\"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 Third International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2011.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文通过定义最大多公平关系,将最大公平推广到多目标和不同主体偏好情况下。根据最大公平性的隐式比较,该泛型关系基于对最大公平性的形式化修改,并将最大公平性作为一个特例。给出了这种多重公平关系在自私群体、协作群体和混合群体中的应用,并通过数值模拟对不可分割物品公平分配的具体任务进行了实例研究。所有的研究都证明了所提出的关系对于共享资源问题的调查任务的适用性,因为它们在网络设计和控制方面是丰富的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Generic Approach to Multi-fairness and Its Application to Wireless Channel Allocation
In this paper we provide an extension of maxmin fairness to the case of multiple objectives and different agent preferences by the definition of the maxmin multi-fairness relation. This generic relation is based on a formal modification of maxmin fairness according to its implicit comparisons and includes maxmin fairness as a special case. The application of this multi-fairness relation to a selfish, to a collaborative and to a mixed community of agents is presented, as well as a case study on a specific task of fair division of indivisible goods by numerical simulations. All studies demonstrate the suitability of the proposed relation for investigative tasks in shared resource problems, as they are abundant in network design and control.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Implementation of Activity Recognition from Accelerometers on Mobile Phones Development of Network User Authentication Gateway System Using "High Performance Packet Processing Engine" A Seamless Connection for Authentication Required Web Sites by Shibboleth Certificateless Ordered Sequential Aggregate Signature Scheme A Study on a Secure Wireless Link Creation Based on Multi-path Routing Combined with Transmit Antenna Directivity Control
×
引用
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