{'fraction_non_alphanumeric': 0.01008827238335435, 'fraction_numerical': 0.0, 'mean_word_length': 5.352, '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}}
A Relational Approach to Collaborative Fairness

In the relational approach to fairness, fairness is considered as a social choice that coincides with the maximum set of a fairness relation. Here we consider the application of this approach to achieve general fairness in collaborative systems. The approach is based on posing additional conditions on the fairness relation based on representation of collaboration among agents by a social graph, and various social types of agents. The relation can be used for the formal analysis of various collaboration scenarios by justifying tractable sizes of maximum sets of corresponding collaborative fairness relations. As an example result, the introduction of cliques of larger size appears to be in favor of achievability of collaborate fairness.