关于「支付意愿显影与合作方底价:BDM 机制、假设性偏差与公开信息推断」,《先手探针与隐藏事实》给出的定量结论是什么?

结论:第六章讲 BDM 机制、陈述偏好与真实购买之间的假设性偏差,以及只用公开报价与公开邀约推断合作方底价,后验区间从 400 到 480。

数据口径:书中参数为示意,全部计算由书中程序生成,数据全部是合成数据。 本书是非个人化经营建议,不构成法律、税务或投资意见,不向任何人承诺收入。

English version

对照数据表

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

public open calls (budget, invited, yes):
(300, 40, 6), (500, 40, 26), (800, 40, 39)
rate cards: n = 12, median posted 816
sourcemean M90% interval
cards only496.2[400, 600]
calls only429.3[390, 470]
both438.8[400, 480]
查看完整验算程序
# Chapter 6. p63: reading a counterpart tier's reserve from public data.
# Illustrative, synthetic. Creators in one tier have reserve fees
# r ~ log-normal(median M, log spread 0.4); M is unknown (grid 200 to
# 900 units, flat prior). Two public sources only, no posing as a client:
#  (1) public rate cards: a posted fee = r * markup, markup uniform on
#      1.1 to 1.5 (unknown per creator);
#  (2) public open calls: we post a real, payable budget b to 40 eligible
#      creators; a creator replies yes when b >= r.
# The data are drawn once from M = 450; the posterior of M is reported
# for each source alone and for both together.
import math
import random

GRID = list(range(200, 901, 10))
SIG = 0.4
MARKUPS = [1.1, 1.2, 1.3, 1.4, 1.5]


def cdf(x, m):
    return 0.5 * math.erfc(-(math.log(x) - math.log(m)) / (SIG * 2 ** 0.5))


def pdf(x, m):
    z = (math.log(x) - math.log(m)) / SIG
    return math.exp(-0.5 * z * z) / (x * SIG * math.sqrt(2 * math.pi))


def loglik_cards(cards, m):
    out = []
    for c in cards:
        dens = math.fsum(pdf(c / k, m) / k for k in MARKUPS) / len(MARKUPS)
        out.append(math.log(dens))
    return math.fsum(out)


def loglik_calls(calls, m):
    out = []
    for b, n, yes in calls:
        p = min(max(cdf(b, m), 1e-12), 1 - 1e-12)
        out.append(yes * math.log(p) + (n - yes) * math.log(1 - p))
    return math.fsum(out)


def summarise(logs):
    top = max(logs)
    w = [math.exp(x - top) for x in logs]
    tot = math.fsum(w)
    w = [x / tot for x in w]
    mean = math.fsum(g * x for g, x in zip(GRID, w))
    lo, hi = None, None
    for i, g in enumerate(GRID):
        cum = math.fsum(w[:i + 1])
        if lo is None and cum >= 0.05:
            lo = g
        if hi is None and cum >= 0.95:
            hi = g
    return mean, lo, hi


if __name__ == "__main__":
    rng = random.Random(39563)
    true_m = 450.0
    cards = [math.exp(rng.gauss(math.log(true_m), SIG))
             * rng.choice(MARKUPS) for _ in range(12)]
    calls = []
    for b in (300, 500, 800):
        yes = 0
        for _ in range(40):
            if math.exp(rng.gauss(math.log(true_m), SIG)) <= b:
                yes += 1
        calls.append((b, 40, yes))
    print("public open calls (budget, invited, yes):")
    print("  " + ", ".join("({}, {}, {})".format(*c) for c in calls))
    print("rate cards: n = {}, median posted {:.0f}".format(
        len(cards), sorted(cards)[6]))
    print("  source        mean M   90% interval")
    for name, f in (("cards only", lambda m: loglik_cards(cards, m)),
                    ("calls only", lambda m: loglik_calls(calls, m)),
                    ("both", lambda m: loglik_cards(cards, m)
                     + loglik_calls(calls, m))):
        mean, lo, hi = summarise([f(m) for m in GRID])
        print("  {:<12} {:>7.1f}   [{}, {}]".format(name, mean, lo, hi))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《高能动性主动推理、意念强度先手扰动与商业隐藏事实勘探母典》第 6 章「支付意愿显影与合作方底价:BDM 机制、假设性偏差与公开信息推断」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-395 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026395,
  author    = {Fan, Yafu},
  title     = {High-Agency Active Inference, Intentional Perturbation Probes and Hidden Market-Truth Exploration},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论