{'fraction_non_alphanumeric': 0.012804097311139564, 'fraction_numerical': 0.0, 'mean_word_length': 5.357723577235772, '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}}
Diffusion based collaborative decision making in noncooperative social network games

We consider noncooperative repeated games in a social network where players form social groups (friendship cliques) of identical interests. Players in each social group collaborate to optimize their payoff function via a diffusion learning based regret-matching procedure. Each player fuses its regrets with those of other members in its social group and uses the fused information to choose its actions. We show that, if all players follow the proposed algorithm, the global behavior converges to the set of correlated equilibria. The collaboration amongst players within social groups results in faster coordination and enables the players to respond in real time to the evolution of the game.