{'fraction_non_alphanumeric': 0.016319129646418858, 'fraction_numerical': 0.0, 'mean_word_length': 5.4941176470588236, '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}}
On primal-dual cost allocation schema in multicast communication: Combinatorial game theory model

We analyze the cost allocation strategy associated with the problem of sending information from some source to a number of communication network users. A multicast routing chooses a minimum cost network that spans the source and all the receivers. The cost of such a network is distributed among its receivers who may be individuals or organizations with possibly conflicting interests. These receivers are likely to cooperate if they are charged the ‘fair share’ of the cost. Providing network developers, users and owners with computable ‘fair’ cost allocation solution procedures is of great importance for network management. We overview some previously published, as well as some new results, in the development of algorithmic cooperative game theory based mechanisms to efficiently compute ‘attractive’ cost allocation solutions for multicast networks. We also present some open cost allocation problems and the potential contribution that combinatorial game theory models might make in the future.