What does Jadeite Identification and the Winner's Curse conclude, in numbers, about “The Ledger of Rough: Adverse Selection, Chosen Windows and the Winner's Curse”?

Answer: Chapter 1 decomposes returns with a model: window selection alone gives a lone buyer a portfolio return of −0.225, while 0.313 of buyers who purchase only five stones see a profit in their ledgers.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not personalised legal or financial advice, nor an identification report on any stone. Marked boxes separate published evidence, runnable Python calculations (18 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.313

windowed rough, 20000 stones per cell (illustrative)
kNportfoliomedianP(loss)P(tripled)
11+0.125+0.3160.3130.0732
13-0.174-0.0640.5530.0088
16-0.286-0.1990.6810.0024
112-0.389-0.3130.7900.0006
124-0.453-0.3910.8690.0002
41-0.225-0.1240.6060.0053
43-0.428-0.3690.8800.0000
46-0.513-0.4670.9600.0000
412-0.577-0.5400.9910.0000
424-0.622-0.5900.9990.0000
k = 1: random window; k = 4: seller opens the best of 4
Show the full program
# Chapter 1. p12: Buyer return on windowed rough, by bidders N and spots k.
# 模型(全部参数为示意):原石内部价值 V = exp(Q),Q ~ N(0, 1)。
# 卖方检查 k 个点位,在读数最好处开窗;点位差异为均值为 1 的对数正态
# 乘子,sigma_spot = 0.4。每个买手对窗口的读数再乘一个均值为 1 的
# 对数正态误差,sigma_read = 0.4。买手按「窗口即代表整块」估值,
# 扣 0.2 的利润与风险折扣后出价;暗标最高价中标并按己价付款。
# 中标后切磨、运输等成本为价值的 0.10。组合回报 = 总净值 / 总付款 - 1。
# k = 1 表示随机开窗(无挑选),N = 1 表示无竞争。固定种子蒙特卡洛。
import math
import random
import statistics

SIG_SPOT, SIG_READ = 0.4, 0.4
MARGIN, COST = 0.2, 0.10
STONES = 20000


def one_stone(rng, n, k):
    q = rng.gauss(0.0, 1.0)
    v = math.exp(q)
    best = max(rng.gauss(-SIG_SPOT ** 2 / 2, SIG_SPOT) for _ in range(k))
    window = v * math.exp(best)
    bids = [window * math.exp(rng.gauss(-SIG_READ ** 2 / 2, SIG_READ))
            * (1 - MARGIN) for _ in range(n)]
    price = max(bids)
    return v * (1 - COST), price


def scenario(n, k, seed):
    rng = random.Random(20261112 + seed)
    nets, paid, rets = [], [], []
    for _ in range(STONES):
        net, price = one_stone(rng, n, k)
        nets.append(net)
        paid.append(price)
        rets.append(net / price - 1)
    port = math.fsum(nets) / math.fsum(paid) - 1
    loss = len([r for r in rets if r < 0]) / STONES
    big = len([r for r in rets if r >= 2.0]) / STONES
    return port, statistics.median(rets), loss, big


def main():
    print("windowed rough, %d stones per cell (illustrative)" % STONES)
    print(" k   N   portfolio   median   P(loss)   P(tripled)")
    seed = 0
    for k in (1, 4):
        for n in (1, 3, 6, 12, 24):
            port, med, loss, big = scenario(n, k, seed)
            seed += 1
            print("%2d %3d   %+8.3f  %+7.3f   %6.3f    %6.4f"
                  % (k, n, port, med, loss, big))
    print("k = 1: random window; k = 4: seller opens the best of 4")


if __name__ == "__main__":
    main()

Single source and citation

Fan, Y. (2026). Hydrostatic Specific Gravity and Bayesian Jadeite Identification, Window-Cut Signalling Games and the Winner's Curse in Rough-Jade Tenders (Version 1.0.0), Chapter 1: The Ledger of Rough: Adverse Selection, Chosen Windows and the Winner's Curse. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-206 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026206,
  author    = {Fan, Yafu},
  title     = {Hydrostatic Specific Gravity and Bayesian Jadeite Identification, Window-Cut Signalling Games and the Winner's Curse in Rough-Jade Tenders},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book