An Axiomatic Theory of Fairness

作者: Mung Chiang , Ashutosh Sabharwal , Tian Lan , David T. H. Kao

DOI:

关键词:

摘要: The tradeoff between fairness and throughput has been widely observed in network analysis protocol design. Despite many existing metrics (from simple ones like Jain’s index to more complex α-fair utility), the meaning of is largely based on problemoriented interpretations judgments, with no well-established framework. To tackle this challenging problem, we presented a set five axioms for fairness, showed that wide range measures satisfying can be constructed unifying construction incorporates as special cases metrics, such index, entropy, utility, also reveals new family measures. Our axiomatic theory illuminates issues resource allocation research, among which novel efficiency fairness. parallelism our framework well-known theories other fields, e.g., Renyi Entropy, Lorenz Curve, Nash Bargaining Solutions, Rawls’ Theory Justice, greatly sharpens understanding notion

参考文章(3)
D. Chiu, R. Jain, W. Hawe, A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems arXiv: Networking and Internet Architecture. ,(1998)
Rishi Bhargava, Ashish Goel, Adam Meyerson, Using approximate majorization to characterize protocol fairness Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '01. ,vol. 29, pp. 330- 331 ,(2001) , 10.1145/378420.378826
M. Uchida, J. Kurose, An Information-Theoretic Characterization of Weighted alpha-Proportional Fairness international conference on computer communications. pp. 1053- 1061 ,(2009) , 10.1109/INFCOM.2009.5062017