面向网络资源公平有效分配的每实体分配特征的多jain公平性指标

M. Köppen, K. Ohnishi, M. Tsuru
{"title":"面向网络资源公平有效分配的每实体分配特征的多jain公平性指标","authors":"M. Köppen, K. Ohnishi, M. Tsuru","doi":"10.1109/INCoS.2013.161","DOIUrl":null,"url":null,"abstract":"Due to its simplicity and its easy comprehension, Jain's fairness index is still among the most popular measures to compare justness of allocations. However, it was already argued in the original paper that while the way of computing the index is well established, it is not immediately clear to which metric to apply the computation. Thereby, metric stands for a specific choice of a system observable. Here we study the extension of Jain's index to multiple metrics at once. We propose a set of per-entity allocation features to represent justness of an allocation, and to derive corresponding vectors of feature-wise taken Jain's fairness indices. The features give a numerical representation of fulfilling common fairness properties like proportionality, envy-freeness and equity of an allocation. Then, maximizing the smallest index gives an efficient procedure for allocation of goods. We study this procedure for the problem of allocating wireless channels in a multi-user setup and compare the influence of the various feature choices on the efficiency of the solution.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Multi-Jain Fairness Index of Per-Entity Allocation Features for Fair and Efficient Allocation of Network Resources\",\"authors\":\"M. Köppen, K. Ohnishi, M. Tsuru\",\"doi\":\"10.1109/INCoS.2013.161\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to its simplicity and its easy comprehension, Jain's fairness index is still among the most popular measures to compare justness of allocations. However, it was already argued in the original paper that while the way of computing the index is well established, it is not immediately clear to which metric to apply the computation. Thereby, metric stands for a specific choice of a system observable. Here we study the extension of Jain's index to multiple metrics at once. We propose a set of per-entity allocation features to represent justness of an allocation, and to derive corresponding vectors of feature-wise taken Jain's fairness indices. The features give a numerical representation of fulfilling common fairness properties like proportionality, envy-freeness and equity of an allocation. Then, maximizing the smallest index gives an efficient procedure for allocation of goods. We study this procedure for the problem of allocating wireless channels in a multi-user setup and compare the influence of the various feature choices on the efficiency of the solution.\",\"PeriodicalId\":353706,\"journal\":{\"name\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCoS.2013.161\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2013.161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

由于其简单易懂,Jain公平性指数仍然是比较分配公平性最常用的指标之一。然而,在原始论文中已经提出,虽然计算指数的方法已经建立,但并不立即清楚将计算应用于哪个度量。因此,度量代表系统可观察对象的特定选择。本文研究了Jain指标对多个度量的扩展。我们提出了一组代表分配公平性的每实体分配特征,并推导出相应的特征取Jain公平性指数向量。这些特征给出了一个数字表示,以满足常见的公平属性,如比例性、免嫉妒性和分配的公平性。然后,最大化最小指数给出了一个有效的货物分配程序。我们研究了在多用户设置下无线信道分配问题的这种方法,并比较了各种特征选择对解决方案效率的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-Jain Fairness Index of Per-Entity Allocation Features for Fair and Efficient Allocation of Network Resources
Due to its simplicity and its easy comprehension, Jain's fairness index is still among the most popular measures to compare justness of allocations. However, it was already argued in the original paper that while the way of computing the index is well established, it is not immediately clear to which metric to apply the computation. Thereby, metric stands for a specific choice of a system observable. Here we study the extension of Jain's index to multiple metrics at once. We propose a set of per-entity allocation features to represent justness of an allocation, and to derive corresponding vectors of feature-wise taken Jain's fairness indices. The features give a numerical representation of fulfilling common fairness properties like proportionality, envy-freeness and equity of an allocation. Then, maximizing the smallest index gives an efficient procedure for allocation of goods. We study this procedure for the problem of allocating wireless channels in a multi-user setup and compare the influence of the various feature choices on the efficiency of the solution.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信