{'fraction_non_alphanumeric': 0.010923535253227408, 'fraction_numerical': 0.0, 'mean_word_length': 5.222222222222222, '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}}
Cooperation in traffic routing games on scale free wireless networks

Local routing protocols in scale free networks have been extensively studied. In this paper we consider a wireless contextualization of this routing problem and analyze on the one hand how cooperation affects network efficiency, and on the other hand the stability of cooperation structures. Cooperation is interpreted as local exchange of topological information between cooperating agents, and the payoff of a certain node is defined based on its energy consumption during the routing process. We show that if the payoff of the nodes is the energy saving compared to the all-singleton case, basically coalitions are not stable. We introduce coalitional load balancing and net reward to enhance coalitional stability and thus the more efficient operation of the network. As in the proposed model cooperation strongly affects routing dynamics of the network, externalities will arise and the game is defined in a partition function form.