{'fraction_non_alphanumeric': 0.015625, 'fraction_numerical': 0.0, 'mean_word_length': 4.774774774774775, '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}}
Learning for allocations in the long-run average core of dynamical cooperative TU games

We consider repeated coalitional TU games characterized by unknown but bounded and time-varying coalitions' values. We build upon the assumption that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to learn on how to re-adjust the allocations among the players. As main result, we present an allocation rule based on the extra reward variable that converges with probability one to the core of the long-run average game. Analogies with stochastic stability theory are put in evidence.