关于「逻辑相关的事件:凸多面体、Frank-Wolfe 投影与套利证书」,《预测市场的价格与套利》给出的定量结论是什么?
结论:第五章把逻辑相关的合约放进凸多面体,手写 Frank-Wolfe 投影求出在所有状态下都赚钱的套利证书;普通变体走 400 步仍未收敛,成对变体精确收敛;两两逻辑规则只抓住 92.9% 的不一致,执行后最好的年化回报只有 +4.6%。
数据口径:本书把这个读法拆成三件事——信念如何聚合成价格、做市机制如何为信息付钱、资本被锁住时价格还能偏离多远——逐一写成可运行的模型,并计算看上去的套利还剩多少能执行。 本书不是投资、交易或博彩建议;全部数据为程序生成的合成数据。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 4.6, 92.9
| A. one unit at quoted prices: gain 0.035 on 0.965 | 3.63% in 6 months |
| units phi net gain capital annualised | |
| 500 | 0.00 8.41 491.6 +3.4% |
| 2000 | 0.00 44.50 1955.5 +4.6% |
| 4000 | 0.00 62.00 3938.0 +3.2% |
| 500 | 0.02 2.49 497.5 +1.0% |
| 2000 | 0.02 20.84 1979.2 +2.1% |
| 2650 | 0.02 22.67 2627.3 +1.7% |
| 500 | 0.07 -12.30 512.3 -4.7% |
| 2000 | 0.07 -38.32 2038.3 -3.7% |
| B. incoherent vectors | 2518 of 4000 |
| caught by R1 (pairwise logic) | 92.9% |
| caught by R2 (plus counting rule) | 100.0% |
| Reading: the guaranteed gain is small next to the capital it | |
| locks - 3.63 % for six months before costs, at best 4.6 % a | |
| year after depth and fixed costs, and a loss at every size with | |
| a 0.07 fee. Pairwise logic misses part of the incoherence | |
| that the polytope catches; for this tiny market one more rule | |
| closes the gap, but real markets have too many facets to list, | |
| which is why the vertex oracle matters. |
核心公式
\[\mathbf{x}\cdot(\boldsymbol{\phi}(s) - \boldsymbol{\theta}) \;\ge\; \lVert \boldsymbol{\mu}^* - \boldsymbol{\theta} \rVert^2 > 0 .\]
查看完整验算程序
# Chapter 5. p11: From certificate to trade, and why simple rules miss it.
# A. The certificate of p10, scaled to buy 1 N and sell 0.5 of each state
# (selling a state = buying its NO at 1 - price), gains at least 0.035
# per unit in every state. Each leg's book deepens by 0.01 per 2,000
# contracts; fee phi P(1 - P) per contract; 2 per leg order; payout in
# 6 months. Annualised return on the capital locked is reported.
# B. 4,000 random price vectors in [0.02, 0.98]^4. A vector is incoherent
# if its Euclidean distance to the polytope (pairwise FW, as in p10)
# exceeds 1e-6. Two rule sets are tried as screens:
# R1 pairwise logic: N >= s_i + s_j - 1 and N <= s_i + s_j
# R2 R1 plus the counting rule 2N <= A + B + C <= 1 + 2N
import itertools
import random
THETA = (0.65, 0.62, 0.60, 0.40)
V = [(a, b, c, 1 if a + b + c >= 2 else 0)
for a, b, c in itertools.product((0, 1), repeat=3)]
UNIT = (-0.5, -0.5, -0.5, 1.0)
STEP, DEPTH, FIXED, TAU = 0.01, 2000.0, 2.0, 0.5
def trade(k, phi):
capital = gain_min = 0.0
for q, th in zip(UNIT, THETA):
n = abs(q) * k
px = th if q > 0 else 1 - th
avg = px + STEP * n / DEPTH / 2
capital += n * avg + phi * n * px * (1 - px) + FIXED
payoff = min(sum(abs(q) * k * (v[j] if q > 0 else 1 - v[j])
for j, q in enumerate(UNIT)) for v in V)
return payoff - capital, capital
def dist(th, iters=300):
w = {i: 1 / 8 for i in range(8)}
for _ in range(iters):
mu = [sum(w[i] * V[i][j] for i in w) for j in range(4)]
g = [a - b for a, b in zip(mu, th)]
s = min(range(8), key=lambda i: sum(x * y for x, y in zip(g, V[i])))
a = max(w, key=lambda i: sum(x * y for x, y in zip(g, V[i])))
d = [x - y for x, y in zip(V[s], V[a])]
dd = sum(x * x for x in d)
if dd == 0:
break
st = max(0.0, min(w[a], -sum(x * y for x, y in zip(g, d)) / dd))
w[a] -= st
w[s] = w.get(s, 0.0) + st
if w[a] <= 1e-15:
del w[a]
mu = [sum(w[i] * V[i][j] for i in w) for j in range(4)]
return sum((a - b) ** 2 for a, b in zip(mu, th)) ** 0.5
def rules(th, counting):
a, b, c, n = th
for x, y in ((a, b), (a, c), (b, c)):
if n < x + y - 1 or n > x + y:
return False
if counting and not (2 * n <= a + b + c <= 1 + 2 * n):
return False
return True
if __name__ == "__main__":
c1 = sum(abs(q) * (th if q > 0 else 1 - th)
for q, th in zip(UNIT, THETA))
g1 = min(sum(abs(q) * (v[j] if q > 0 else 1 - v[j])
for j, q in enumerate(UNIT)) for v in V) - c1
print("A. one unit at quoted prices: gain {:.3f} on {:.3f}"
" = {:.2%} in 6 months".format(g1, c1, g1 / c1))
print(" units phi net gain capital annualised")
for phi in (0.0, 0.02, 0.07):
best = max(range(10, 40001, 10), key=lambda k: trade(k, phi)[0])
sizes = (500, 2000) + ((best,) if trade(best, phi)[0] > 0 else ())
for k in sizes:
net, cap = trade(k, phi)
ann = ((cap + net) / cap) ** (1 / TAU) - 1
print(" {:6d} {:4.2f} {:9.2f} {:8.1f} {:+.1%}".format(
k, phi, net, cap, ann))
rng = random.Random(59011)
inc = r1 = r2 = 0
for _ in range(4000):
th = [rng.uniform(0.02, 0.98) for _ in range(4)]
if dist(th) > 1e-6:
inc += 1
r1 += not rules(th, False)
r2 += not rules(th, True)
print("\nB. incoherent vectors: {} of 4000".format(inc))
print(" caught by R1 (pairwise logic): {:5.1%}".format(r1 / inc))
print(" caught by R2 (plus counting rule): {:5.1%}".format(r2 / inc))
print("\nReading: the guaranteed gain is small next to the capital it")
print("locks - 3.63 % for six months before costs, at best 4.6 % a")
print("year after depth and fixed costs, and a loss at every size with")
print("a 0.07 fee. Pairwise logic misses part of the incoherence")
print("that the polytope catches; for this tiny market one more rule")
print("closes the gap, but real markets have too many facets to list,")
print("which is why the vertex oracle matters.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《预测市场微观结构、布雷格曼信息投影与跨盘口无套利边界》第 5 章「逻辑相关的事件:凸多面体、Frank-Wolfe 投影与套利证书」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090166
DOI: 10.5281/zenodo.24090166 · 阅读本章所在专著 · 5DL-B-059 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026059,
author = {Fan, Yafu},
title = {Prediction Market Microstructure, Bregman Information Projection and Cross-Book Arbitrage Bounds},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090166},
url = {https://doi.org/10.5281/zenodo.24090166}
}