{'fraction_non_alphanumeric': 0.028070175438596492, 'fraction_numerical': 0.0, 'mean_word_length': 5.303867403314917, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Axiomatic Theory of Fairness

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