{'fraction_non_alphanumeric': 0.01882845188284519, 'fraction_numerical': 0.0, 'mean_word_length': 4.9875, '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}}
Bounded Computational Capacity Equilibrium in Repeated Two-Player Zero-Sum Games

We propose a generalization of the notion of bounded computational capacity equilibrium in repeated zero-sum games played by finite automata. We show that if the players’ mixed strategies are to contain automata of the same size, the equilibrium in our sense does not exist in general, and if the players are allowed to mix automata of different sizes, the equilibrium in our sense always exists.