关于「有限期二叉树:逐年续费、弃续与立项的动态规划」,《域名池续费剪枝》给出的定量结论是什么?
结论:A 段把第一章的两条永续边界放进了时间维度。只剩一年时,下边界高达 3,052,上边界低到 10,692;剩两年时是 2,157 与 11,844;剩五年时是 1,303 与 13,807;剩十年时是 918 与 14,802;剩四十年时是 665 与 15,397,已接近第一章的永续值 599 与 16,849。
数据口径:示意参数下,触发倍数为 2.893,续费 15 时下边界为 599、上边界为 16,849;42 枚示意名字里有 23 枚应当弃续,期权部分占最优价值的 0.861,合理续费只需全额 1,340 中的一小部分。 核对原文之后,本书做了蓝图修正:2012 年的精确匹配域名更新针对的是低质量网站,名字不带排名加成只是稳健性假定;林登塔尔的重复交易指数只反映成交过的名字;不依赖排名的访问在示意参数下约占 0.309,是可靠的地板而不是流量的大头。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 10692, 11844, 1303, 13807, 14802, 15397
| A. boundaries by horizon left, fee 15, 4 steps a year | |
| years drop L build H | |
| 1 | 3,052 10,692 |
| 2 | 2,157 11,844 |
| 3 | 1,693 12,772 |
| 5 | 1,303 13,807 |
| 10 | 918 14,802 |
| 20 | 719 15,287 |
| 40 | 665 15,397 |
| B. 40-year boundaries by fee | |
| fee | 12: L 577, H 15,488 |
| fee | 35: L 1,135, H 14,815 |
| fee | 60: L 1,583, H 14,135 |
查看完整验算程序
# Chapter 3. p32: drop and build boundaries by years of horizon left.
# Model: the lattice of p31 with 4 steps a year. For each horizon the
# drop boundary is the lowest V at which renewing is worth more than 0
# and the build boundary is the lowest V at which building now beats
# waiting; both found by bisection on V. The perpetual boundaries of
# p12 (fee 15: L = 599, H = 16,849) are the long-horizon limit.
# Parameters illustrative (r 0.08, y 0.06, s 0.35, K 6,000).
import math
def root(v0, c, k, years, steps=4, r=0.08, y=0.06, s=0.35):
dt = 1.0 / steps
n = years * steps
u = math.exp(s * math.sqrt(dt))
d = 1 / u
q = (math.exp((r - y) * dt) - d) / (u - d)
disc = math.exp(-r * dt)
w = [max(v0 * u ** j * d ** (n - j) - k, 0.0) for j in range(n + 1)]
cont = 0.0
for t in range(n - 1, -1, -1):
new = []
for j in range(t + 1):
v = v0 * u ** j * d ** (t - j)
cont = -c * dt + disc * (q * w[j + 1] + (1 - q) * w[j])
new.append(max(0.0, v - k, cont))
w = new
return w[0], cont
def boundary(test, lo, hi):
for _ in range(40):
mid = (lo + hi) / 2
if test(mid):
hi = mid
else:
lo = mid
return hi
if __name__ == "__main__":
k = 6000
print("A. boundaries by horizon left, fee 15, 4 steps a year")
print(" years drop L build H")
for yrs in (1, 2, 3, 5, 10, 20, 40):
low = boundary(lambda v: root(v, 15, k, yrs)[1] > 0, 1, 20000)
high = boundary(lambda v: v - k >= root(v, 15, k, yrs)[1],
k, 40000)
print(" {:>5} {:>7,.0f} {:>8,.0f}".format(yrs, low, high))
print("B. 40-year boundaries by fee")
for c in (12, 35, 60):
low = boundary(lambda v: root(v, c, k, 40)[1] > 0, 1, 20000)
high = boundary(lambda v: v - k >= root(v, c, k, 40)[1],
k, 40000)
print(" fee {:>3}: L {:>6,.0f}, H {:>7,.0f}".format(c, low, high))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《精确地域域名实物期权估值、续费剪枝最优停时与自然搜索垄断护城河母典》第 3 章「有限期二叉树:逐年续费、弃续与立项的动态规划」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-341 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026341,
author = {Fan, Yafu},
title = {Real-Options Valuation of Geo-Exact Domain Portfolios, Optimal Renewal Pruning and the Moats of Organic Search},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}