关于「循环克制:对称零和矩阵博弈的混合均衡与反直觉的补丁效应」,《卡牌费用回归与循环克制》给出的定量结论是什么?

结论:第四章求解循环克制的混合均衡:加强快攻,涨份额的是克制它的控制,增幅 0.121。

数据口径:本书用一款自拟的示意卡牌游戏「衡枢」把这些问题写成可以运行的算术。 书中卡池、胜率与价格参数均为示意;全部计算由书中程序生成;本书不是法律、财务或投资建议,也不推荐任何购买。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.121

base: Aggro>Combo 0.65, Control>Aggro 0.60, Combo>Control 0.70
Aggro share4/9 = 0.444 mean win vs even field 0.517
Control share1/3 = 0.333 mean win vs even field 0.467
Combo share2/9 = 0.222 mean win vs even field 0.517
patch: Aggro>Combo raised to 0.75
Aggro share4/11 = 0.364 mean win vs even field 0.550
Control share5/11 = 0.455 mean win vs even field 0.467
Combo share2/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
查看完整验算程序
# 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])))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《非对称策略卡牌费用收益回归、牌库构筑超几何卡手率边界与优势策略循环克制》第 4 章「循环克制:对称零和矩阵博弈的混合均衡与反直觉的补丁效应」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论