{"title":"Unsorting the Proportional Fairness Relation","authors":"M. Köppen, Kaori Yoshida, M. Tsuru","doi":"10.1109/INCoS.2011.159","DOIUrl":null,"url":null,"abstract":"Typical problems related to the application of proportional fairness are sparsity of the relation with increasing dimension, and the operator confusion problem. Here, we propose a new fairness relation derived from proportional fairness to handle these problems. The design principle behind this relation is relational unsorting: if there is a relation x(R)y between elements x and y from n-dimensional Euclidian space, the unsorted relation x(uR)y holds whenever there is a permutation x* of the elements of x for which x*(R)y holds. We apply this concept to proportional fairness, study the properties of the new relation, contrast with another relation based on over-sorting proportional fairness, and provide simulations to demonstrate the ease of ordered proportional fairness for meta-heuristic search.","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":"4","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.159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Typical problems related to the application of proportional fairness are sparsity of the relation with increasing dimension, and the operator confusion problem. Here, we propose a new fairness relation derived from proportional fairness to handle these problems. The design principle behind this relation is relational unsorting: if there is a relation x(R)y between elements x and y from n-dimensional Euclidian space, the unsorted relation x(uR)y holds whenever there is a permutation x* of the elements of x for which x*(R)y holds. We apply this concept to proportional fairness, study the properties of the new relation, contrast with another relation based on over-sorting proportional fairness, and provide simulations to demonstrate the ease of ordered proportional fairness for meta-heuristic search.