{'fraction_non_alphanumeric': 0.019525801952580194, 'fraction_numerical': 0.0, 'mean_word_length': 5.587155963302752, '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}}
Equilibrium selection in multistage congestion games for real-time streaming

We model peer-to-peer real-time streaming as a multistage congestion game with strategies consisting of time-sequences of network nodes (or peers), and identify a large set of strategy profiles through which the whole content reaches all peers in a minimum number of time-periods. In order to make these profiles sustainable as equilibria, we provide strategy restriction mechanisms implementing those equilibria where both streaming duration and congestion are minimized. Their functioning is exemplified in a simple simulation environment. The potential and social cost of equilibrium without strategy restrictions are also investigated.