关于「合盘评分是一个双线性形式」,《双人耦合与网格博弈》给出的定量结论是什么?
结论:第一章把合盘评分写成双线性形式,并把矩阵唯一地分成对称部分与反对称部分:反对称部分越大,符号相反的「单向」配对越多,比例为 1.0 时一个人「最适合给予的对象」与「最能给予自己的对象」在 0.985 的情形下不是同一个人;只观察两人共有的结局时,16 个参数中只有 10 个可以识别,单向性必须对每个人分别测量才能看见。
数据口径:本书只研究这些数学结构本身,不主张、也不检验任何术数意义上的预测;全部数据为程序生成的合成数据,物理与博弈概念用于人际关系之处一律标为类比。 第七章与咸、恒两卦的《彖传》、《烟波钓叟赋》与杨辉纵横图并读;咸卦颠倒即为恒卦,被读作矩阵的转置,并标为诠释。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.985, 1.0
| r = |K|/|S| | mutual | one-way | both negative | top match differs |
|---|---|---|---|---|
| 0.0 | 0.498 | 0.000 | 0.502 | 0.000 |
| 0.5 | 0.355 | 0.288 | 0.357 | 0.840 |
| 1.0 | 0.252 | 0.495 | 0.253 | 0.985 |
| 2.0 | 0.153 | 0.699 | 0.148 | 1.000 |
| Reading: with a symmetric M (r = 0) no pair is one-way. As the | ||||
| antisymmetric part grows, more pairs have scores of opposite sign | ||||
| and a person's best match depends on which direction is asked. |
核心公式
\[s(A, B) = x_A^{\top} M x_B = \sum_{i,j} x_{A,i}\, M_{ij}\, x_{B,j},\]
查看完整验算程序
# Chapter 1. A bilinear compatibility score and its two halves.
# Each person is a vector x of d = 6 traits, each uniform on [-1, 1]. The
# score of A towards B is s(A, B) = x_A' M x_B. If M is not symmetric,
# s(A, B) and s(B, A) differ. Every square M splits uniquely as M = S + K with
# S = (M + M') / 2 symmetric -> s(A,B) + s(B,A) = 2 x_A' S x_B
# K = (M - M') / 2 antisymmetric -> s(A,B) - s(B,A) = 2 x_A' K x_B
# r = |K| / |S| (Frobenius norms) measures how one-sided M is. For each r the
# program draws M, then 20,000 random pairs, and counts pairs where both
# scores are positive (mutual), where the signs differ (one-way), and where
# both are negative; and, in a pool of 200 people, how often A's best match
# "by what A gives" differs from A's best match "by what A receives".
import random
D, PAIRS, POOL = 6, 20000, 200
def rand_matrix(rng, r):
a = [[rng.gauss(0, 1) for _ in range(D)] for _ in range(D)]
s = [[(a[i][j] + a[j][i]) / 2 for j in range(D)] for i in range(D)]
b = [[rng.gauss(0, 1) for _ in range(D)] for _ in range(D)]
k = [[(b[i][j] - b[j][i]) / 2 for j in range(D)] for i in range(D)]
ns = sum(v * v for row in s for v in row) ** 0.5
nk = sum(v * v for row in k for v in row) ** 0.5
return [[s[i][j] / ns + r * k[i][j] / nk for j in range(D)]
for i in range(D)]
def score(m, x, y):
return sum(x[i] * m[i][j] * y[j] for i in range(D) for j in range(D))
def person(rng):
return [rng.uniform(-1, 1) for _ in range(D)]
if __name__ == "__main__":
print(" r = |K|/|S| mutual one-way both negative"
" top match differs")
for r in (0.0, 0.5, 1.0, 2.0):
rng = random.Random(62001)
m = rand_matrix(rng, r)
mu = one = neg = 0
for _ in range(PAIRS):
a, b = person(rng), person(rng)
sab, sba = score(m, a, b), score(m, b, a)
if sab > 0 and sba > 0:
mu += 1
elif sab < 0 and sba < 0:
neg += 1
else:
one += 1
pool = [person(rng) for _ in range(POOL)]
diff = 0
for i, a in enumerate(pool):
others = [j for j in range(POOL) if j != i]
give = max(others, key=lambda j: score(m, a, pool[j]))
get = max(others, key=lambda j: score(m, pool[j], a))
diff += give != get
print(" {:3.1f} {:6.3f} {:6.3f} {:6.3f}"
" {:5.3f}".format(r, mu / PAIRS, one / PAIRS,
neg / PAIRS, diff / POOL))
print("\nReading: with a symmetric M (r = 0) no pair is one-way. As the")
print("antisymmetric part grows, more pairs have scores of opposite sign")
print("and a person's best match depends on which direction is asked.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《双人相位耦合、双线性相容张量与时空网格博弈》第 1 章「合盘评分是一个双线性形式」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090172
DOI: 10.5281/zenodo.24090172 · 阅读本章所在专著 · 5DL-B-062 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026062,
author = {Fan, Yafu},
title = {Dyadic Phase Coupling, Bilinear Compatibility Tensors and Spatiotemporal Grid Games},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090172},
url = {https://doi.org/10.5281/zenodo.24090172}
}