{'fraction_non_alphanumeric': 0.016867469879518072, 'fraction_numerical': 0.0, 'mean_word_length': 5.117647058823529, '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}}
A Necessary and Sufficient Condition for Approachability

In the framework of two-person repeated games with vector payoffs, Blackwell defined the property of approachability and introduced a sufficient condition for it. He also proved that this condition is necessary in the case of convex sets.We generalize this result: A set is approachable if and only if it contains a set that satisfies Blackwell's condition.