What does Card Cost Regression and Cyclic Counters conclude, in numbers, about “Cyclic Counters: the Mixed Equilibrium of a Symmetric Zero-Sum Matrix Game and a Counter-Intuitive Patch Effect”?
Answer: Chapter 4 solves the mixed equilibrium of counter cycles: strengthening aggro raises the share of control, its counter, by 0.121.
Scope of the numbers: Its card pool, win rates and prices are illustrative; all calculations are generated by its programs; the book is not legal, financial or investment advice and recommends no purchase. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.121
| base: Aggro>Combo 0.65, Control>Aggro 0.60, Combo>Control 0.70 | |
| Aggro share | 4/9 = 0.444 mean win vs even field 0.517 |
| Control share | 1/3 = 0.333 mean win vs even field 0.467 |
| Combo share | 2/9 = 0.222 mean win vs even field 0.517 |
| patch: Aggro>Combo raised to 0.75 | |
| Aggro share | 4/11 = 0.364 mean win vs even field 0.550 |
| Control share | 5/11 = 0.455 mean win vs even field 0.467 |
| Combo share | 2/11 = 0.182 mean win vs even field 0.483 |
| change in Aggro share -0.081 | |
| change in Control share +0.121 | |
| change in Combo share -0.040 |
Show the full program
# Chapter 4. p41: Mixed Nash equilibrium of a three-deck cycle, exact.
# Invented metagame (illustrative): Aggro beats Combo, Control beats
# Aggro, Combo beats Control. W[i][j] = chance deck i beats deck j;
# the payoff A = 2W - 1 is antisymmetric, so the game is symmetric and
# zero-sum with value 0. The interior equilibrium solves A x = 0 with
# shares summing to 1, done here in exact fractions (Gauss-Jordan).
from fractions import Fraction as F
DECKS = ["Aggro", "Control", "Combo"]
def solve(W):
n = len(W)
A = [[2 * W[i][j] - 1 for j in range(n)] for i in range(n)]
M = [A[i][:] + [F(0)] for i in range(n - 1)] + [[F(1)] * n + [F(1)]]
for c in range(n):
p = next(r for r in range(c, n) if M[r][c] != 0)
M[c], M[p] = M[p], M[c]
M[c] = [v / M[c][c] for v in M[c]]
for r in range(n):
if r != c and M[r][c] != 0:
f = M[r][c]
M[r] = [a - f * b for a, b in zip(M[r], M[c])]
return [M[i][n] for i in range(n)]
def matrix(ag_cb, ct_ag, cb_ct):
W = [[F(1, 2)] * 3 for _ in range(3)]
W[0][2], W[2][0] = ag_cb, 1 - ag_cb
W[1][0], W[0][1] = ct_ag, 1 - ct_ag
W[2][1], W[1][2] = cb_ct, 1 - cb_ct
return W
def report(tag, W):
x = solve(W)
print(tag)
for i, d in enumerate(DECKS):
avg = (W[i][0] + W[i][1] + W[i][2]) / 3
print(" {:8} share {:>6} = {:.3f} mean win vs even field {:.3f}"
.format(d, str(x[i]), float(x[i]), float(avg)))
return x
base = report("base: Aggro>Combo 0.65, Control>Aggro 0.60, Combo>Control"
" 0.70", matrix(F(65, 100), F(60, 100), F(70, 100)))
buff = report("patch: Aggro>Combo raised to 0.75",
matrix(F(75, 100), F(60, 100), F(70, 100)))
for i, d in enumerate(DECKS):
print(" change in {:8} share {:+.3f}".format(
d, float(buff[i] - base[i])))Single source and citation
Fan, Y. (2026). Cost-Benefit Regression for Asymmetric Strategy Cards, Hypergeometric Brick-Rate Bounds in Deck Building and Cyclic Counters to Dominant Strategies (Version 1.0.0), Chapter 4: Cyclic Counters: the Mixed Equilibrium of a Symmetric Zero-Sum Matrix Game and a Counter-Intuitive Patch Effect. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-179 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026179,
author = {Fan, Yafu},
title = {Cost-Benefit Regression for Asymmetric Strategy Cards, Hypergeometric Brick-Rate Bounds in Deck Building and Cyclic Counters to Dominant Strategies},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Cost-Benefit Regression: Least Squares Finds the Under-Costed and the Over-Costed
- Chapter 2 · Hypergeometric Brick Rates: the Seven-Card Hand, Turn-by-Turn Bricks and a Feasible Band of Resources
- Chapter 3 · The Mana Curve: a Markov Chain for Expected Available Mana and a Simulation of Mana Spent
- Chapter 5 · Counterfactual Regret Minimisation: from a Three-Card Bluffing Duel to a Must-Pick Broken Deck
- Chapter 6 · Testing for a Must-Pick Broken Deck and Regression Checks on Balance Patches
- Chapter 7 · The Classics Examined: Ban Gu's Essay on the Purport of Go and von Neumann's Theory of Parlour Games
- Chapter 8 · Practice and Falsification: a Publisher's Checklist, a Pricing Calculator and Pre-Registered Tests