A matchup cycle has no single all-pairs winner¶
Cross-Domain EchoesShared pattern · Rock-Paper-Scissors (Intransitive Cyclic Dominance)
In the illustrative fighting-game matrix, a grappler uses close-range grabs, a zoner controls distance with long-range attacks, and a rushdown character attacks rapidly. The grappler beats the zoner, the zoner beats rushdown, and rushdown beats the grappler. The hypothetical doctrine model has a parallel ring: armor-heavy beats air mobility, air mobility beats anti-tank-heavy, and anti-tank-heavy beats armor-heavy. Each arrow is a contextual pairwise relation, not a general score for the option at its tail. A single ranking cannot preserve all three arrows: whichever option is put first still has a counter. Keeping the ring visible also shows why dropping an apparently unimportant option can remove the counter to another. Both sides are authored model examples, so the lesson concerns the structure of their assumptions rather than measured real-world superiority.
Choose a role to see its counterpart in both examples. The diagrams show relationships, not measured quantities.
Game matchup analysis
A hypothetical matchup ring has no all-pairs champion
Read Beats-Relation MatrixMechanism
The source’s illustrative matrix records a cycle among grappler, zoner and rushdown under declared context and exception conditions.
In this example: This is the source’s hypothetical matchup example, not a factual tier list or a claim about measured tournament outcomes.
Hypothetical doctrine simulation
A modeled counter cycle is conditional on its assumptions
Read Nontransitive Scenario SimulationMechanism
The source’s illustrative simulation gives armor, air mobility and anti-tank-heavy doctrine a directed cycle of advantage.
In this example: Only the modeled relation is transferred. No real-world doctrine ranking, tactical recommendation or inevitable dynamic cycle is asserted.
The conclusion is conditional on this repertoire and its declared matchup context.
Written comparison
The declared repertoire
Game matchup analysis
Three fighting-game styles
Hypothetical doctrine simulation
Three modeled doctrine packages
The conclusion is conditional on this repertoire and its declared matchup context.
The closed counter relation
Game matchup analysis
Grappler → zoner → rushdown → grappler
Hypothetical doctrine simulation
Armor → mobility → anti-tank → armor
The arrows mean advantage over the next option. No linear order preserves every arrow.
What carries across
Inspect who counters whom before compressing pairwise relations into one score. A cycle prevents an all-pairs champion even when a chosen aggregate score can still be calculated.
Where the comparison stops
The game matrix and doctrine simulation are hypothetical examples, with different contexts and evidence needs. Their edges are not real-world recommendations.
- A three-way beats cycle alone establishes no universal coexistence, mixed-strategy weights or oscillation. Dynamic behavior also depends on numerical payoffs and update rules.
- A numerical scoring convention can rank options, but that ranking cannot reproduce every pairwise advantage in a genuine cycle. No claim about equal row sums is needed.
Conditions for this comparison
- Declare the repertoire, edge direction, activating context and exceptions.
- Check that apparent cycles survive noise and context controls; retain the simulation’s boundary assumptions.
Source entries
Shared pattern
Rock-Paper-Scissors (Intransitive Cyclic Dominance)
Prime
Core Idea
A relation over a set of options is *intransitive* when "A beats B" and "B beats C" do not entail "A beats C" — and in its strongest form a *cycle* closes: A beats B, B beats C, C beats A. No option is globally dominant; the ranking is circular rather than linear.
Game matchup analysis
Beats-Relation Matrix
Mechanism
Example
The team lists the three characters as both rows and columns, then fills each off-diagonal cell from tournament replays: the grappler beats the zoner (closes distance and punishes), the zoner beats the rushdown (walls it out at range), and the rushdown beats the grappler (too fast to grab).
How it works
- Record each ordered pair as a directed edge. For every A→B, note the direction of advantage plus three annotations: a confidence tag (evidence quantity/quality), the activating context, and any exception that reverses the edge.
When it helps, and when it misleads
Its failure mode is that a matrix will happily record a cycle that is not really there — impose a rock-paper-scissors story on what is actually a transitive ranking with noise, or a few small-sample flukes. This is the same trap the Condorcet paradox warns of: pairwise wins can *look* cyclic without a stable underlying loop. The classic misuse is the mirror image — reading a single "tier list" ranking off a chart whose arrows genuinely form a ring, eliminating the option that closes the loop. The guarding discipline is to treat the matrix as a claim to be *tested*, not trusted: draw edges only at a confidence threshold, keep exceptions visible, and hand the whole artifact to a pairwise audit before acting on it.
Hypothetical doctrine simulation
Nontransitive Scenario Simulation
Mechanism
Example
When both adversary and allies adapt to a currently-dominant armor doctrine, the sim shows the field *orbiting* — armor rises, anti-tank proliferates in response, mobility then dominates the anti-tank-heavy battlespace, and armor returns — a cycle, not a winner.
How it works
- Encode the relations and triggers. Load the pairwise beats-relations and the context conditions that activate each edge, so the cycle in the model matches the one being studied.