{'fraction_non_alphanumeric': 0.026584867075664622, 'fraction_numerical': 0.010906612133605999, 'mean_word_length': 5.327586206896552, '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}}
Names for Games: Locating 2 × 2 Games

Prisoner’s Dilemma, Chicken, Stag Hunts, and other two-person two-move (2 × 2) models of strategic situations have played a central role in the development of game theory. The Robinson–Goforth topology of payoff swaps reveals a natural order in the payoff space of 2 × 2 games, visualized in their four-layer “periodic table” format that elegantly organizes the diversity of 2 × 2 games, showing relationships and potential transformations between neighboring games. This article presents additional visualizations of the topology, and a naming system for locating all 2 × 2 games as combinations of game payoff patterns from the symmetric ordinal 2 × 2 games. The symmetric ordinal games act as coordinates locating games in maps of the payoff space of 2 × 2 games, including not only asymmetric ordinal games and the complete set of games with ties, but also ordinal and normalized equivalents of all games with ratio or real-value payoffs. An efficient nomenclature can contribute to a systematic understanding of the diversity of elementary social situations; clarify relationships between social dilemmas and other joint preference structures; identify interesting games; show potential solutions available through transforming incentives; catalog the variety of models of 2 × 2 strategic situations available for experimentation, simulation, and analysis; and facilitate cumulative and comparative research in game theory.