What does Jadeite Identification and the Winner's Curse conclude, in numbers, about “Window Signals: Best-Spot Bias, a Separating Equilibrium and the Unravelling of Unwindowed Rough”?
Answer: Chapter 4 computes the window bias (a seller who examines four spots makes an uncorrecting buyer overpay 0.311), a separating equilibrium in window size (when faking is cheap a naive buyer overpays 42.0 per stone) and the unravelling of unwindowed rough.
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.311
| window at the best of k spots, spot spread s | 0.4 |
| k E[max z] F_k overpay share 1 - 1/F_k | |
| 1 | 0.000 1.000 0.000 |
| 2 | 0.564 1.223 0.182 |
| 3 | 0.846 1.356 0.262 |
| 4 | 1.029 1.451 0.311 |
| 6 | 1.267 1.586 0.369 |
| 8 | 1.424 1.682 0.406 |
| sensitivity at k | 4: |
| s | 0.2 F_4 = 1.216 overpay share 0.178 |
| s | 0.4 F_4 = 1.451 overpay share 0.311 |
| s | 0.6 F_4 = 1.698 overpay share 0.411 |
| s | 0.8 F_4 = 1.953 overpay share 0.488 |
Show the full program
# Chapter 4. p41: A window cut at the best of k spots overstates the stone.
# 点位品质 = 整块水平乘以均值为 1 的对数正态乘子 exp(s Z - s^2/2)。
# 卖方看 k 个点位,在最好处开窗。买方若把窗口当随机样本,高估倍数为
# F_k = E[exp(s Z_(k) - s^2/2)],Z_(k) 为 k 个标准正态的最大值;
# 用数值积分精确计算。s = 0.4 与 p12 相同(示意),并对 s 做敏感度扫描。
# 合理的修正是把窗口读数除以 F_k;1 - 1/F_k 是不修正时多付的份额。
import math
from statistics import NormalDist
ND = NormalDist()
def moment(k, s, lo=-9.0, hi=9.0, steps=18000):
"""Return (E[Z_(k)], E[exp(s Z_(k) - s^2/2)]) by Simpson's rule."""
h = (hi - lo) / steps
m1, m2 = [], []
for i in range(steps + 1):
x = lo + i * h
f = k * ND.pdf(x) * ND.cdf(x) ** (k - 1)
w = 1 if i in (0, steps) else (4 if i % 2 else 2)
m1.append(w * x * f)
m2.append(w * math.exp(s * x - s * s / 2) * f)
return math.fsum(m1) * h / 3, math.fsum(m2) * h / 3
def main():
s = 0.4
print("window at the best of k spots, spot spread s = %.1f" % s)
print(" k E[max z] F_k overpay share 1 - 1/F_k")
for k in (1, 2, 3, 4, 6, 8):
ez, f = moment(k, s)
print("%3d %5.3f %6.3f %6.3f" % (k, ez, f, 1 - 1 / f))
print("sensitivity at k = 4:")
for s2 in (0.2, 0.4, 0.6, 0.8):
ez, f = moment(4, s2)
print(" s = %.1f F_4 = %.3f overpay share %.3f"
% (s2, f, 1 - 1 / f))
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 4: Window Signals: Best-Spot Bias, a Separating Equilibrium and the Unravelling of Unwindowed Rough. 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
- Chapter 1 · The Ledger of Rough: Adverse Selection, Chosen Windows and the Winner's Curse
- Chapter 2 · Hydrostatic Weighing: Specific-Gravity Error and the Limits of a Single Reading
- Chapter 3 · Chained Likelihood Ratios: Bayesian Identification by Specific Gravity, Refractive Index and Fluorescence
- Chapter 5 · Sealed Tenders: a Monte Carlo of the Winner's Curse in N-Bidder Common-Value Auctions
- Chapter 6 · The Bid Cap: Folding Identification, Window and Curse into One Number, with Stake Size and Ruin
- Chapter 7 · Classical Sources East and West: the Tiangong Kaiwu on Jade and Book 37 of Pliny's Natural History
- Chapter 8 · Closing the Loop: the Buyer's Flow Card, the Bid Cap, a Compliant Script and Pre-Registered Tests