{'fraction_non_alphanumeric': 0.023166023166023165, 'fraction_numerical': 0.003861003861003861, 'mean_word_length': 5.323170731707317, '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}}
Global Games With Strategic Complements and Substitutes

We extend the global games method to the class of finite player, finite action games that includes games with strategic complements, games with strategic substitutes, and arbitrary combinations of the two. Our result is based on common order properties present in both strategic complements and substitutes, the notion of p-dominance, and the use of dominance solvability as the solution concept. In addition to being closer to the original arguments in Carlsson and van Damme (1993), our approach requires fewer additional assumptions. In particular, we require only one dominance region, and no assumptions on state monotonicity, or aggregative structure, or overlapping dominance regions. As expected, the p-dominance condition becomes more restrictive as the number of players increases. In cases where the probabilistic burden in belief formation may be reduced, the p-dominance condition may be relaxed as well. We present examples that are not covered by existing results.