{'fraction_non_alphanumeric': 0.02664298401420959, 'fraction_numerical': 0.0, 'mean_word_length': 5.590643274853801, '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}}
Characterizing robust solutions in monotone games

In game theory, p-dominance and p-best response sets serve as important robustness solution concepts by allowing for deviations from the stringent common knowledge requirements of Nash equilibrium. However, solving for such sets remains largely intractable beyond the simplest of settings. The contributions of this paper are twofold: First, in monotone games, (which include the broad class of supermodular games, submodular games, and their combinations,) we show that these concepts can be characterized in terms of pure strategy Nash equilibria in an auxiliary game of complete information. This makes it considerably easier to compute such sets, facilitating their broader use. Second, these characterizations lead to new results about the structure of entire classes of such solution concepts, including minimal p-best response (p-MBR) sets, which generalize wellknown results for pure strategy Nash equilibria. In games with strategic complements, these classes are complete lattices. More generally, they are totally unordered. Several examples highlight the results.