What does Pruning a Domain Portfolio conclude, in numbers, about “Carrying Cost and the Development Option: the Value of Waiting, Renewal Fees and Two Boundaries”?
Answer: In the first row of Part A the fee is nearly zero, the lower boundary is close to zero and the upper boundary is the 17,360 of p11: the model reduces to the case without fees, as it should. With a fee of 15, the present value of renewing forever is 188, the lower boundary rises to 599, the upper boundary falls to 16,849, and the trigger multiple falls to 2.808. With a fee of 120, the present value of fees is 1,500, the lower boundary rises to 2,168, the upper boundary falls to 13,906 and the multiple falls to 2.318.
Scope of the numbers: Chapter 2 examines the price evidence: in the illustrative model a repeat-sales estimate is biased upwards by 0.1284, and applying the index's growth of 0.0723 a year leads to systematic under-pruning. Marked boxes separate published evidence, runnable Python calculations (20 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: 120, 13906, 15, 1500, 16849, 17360
| A. drop and build boundaries by renewal fee (K | 6,000) |
| fee/yr PV fees drop L build H H/K | |
| 0.01 | 0 5 17,360 2.893 |
| 12 | 150 518 16,948 2.825 |
| 15 | 188 599 16,849 2.808 |
| 35 | 438 1,028 16,214 2.702 |
| 60 | 750 1,437 15,475 2.579 |
| 120 | 1,500 2,168 13,906 2.318 |
| B. value of keeping one name, fee 15 per year | |
| V keep value decision | |
| 50 | 0.0 DROP |
| 100 | 0.0 DROP |
| 200 | 0.0 DROP |
| 400 | 0.0 DROP |
| 800 | 11.1 HOLD |
| 1,600 | 166.5 HOLD |
| 3,200 | 712.4 HOLD |
| 17,500 | 11,500.0 BUILD |
Key formula
Show the full program
# Chapter 1. p12: renewal fee turns one trigger into two boundaries.
# Model: holding the name costs a renewal flow c per year. The value of
# a held, unbuilt name is W(V) = A1 V^b1 + A2 V^b2 - c / r on (L, H):
# drop the name when V falls to L (W = 0, W' = 0), build when V rises
# to H (W = H - K, W' = 1). With z = H / L the four conditions reduce
# to one equation in z, solved by bisection; then L and H follow.
# Parameters illustrative (r 0.08, d 0.06, sigma 0.35, K 6,000).
import math
def roots(r, d, s):
a = 0.5 - (r - d) / (s * s)
b = math.sqrt(a * a + 2 * r / (s * s))
return a + b, a - b
def bounds(c, k, r=0.08, d=0.06, s=0.35):
b1, b2 = roots(r, d, s)
x = -b2 * (c / r) / (b1 - b2)
y = b1 * (c / r) / (b1 - b2)
def rhs(z):
return (b1 - 1) * x * z ** b1 + (b2 - 1) * y * z ** b2 + c / r
lo, hi = 1.0, 2.0
while rhs(hi) < k:
hi *= 2
for _ in range(200):
mid = (lo + hi) / 2
if rhs(mid) < k:
lo = mid
else:
hi = mid
z = (lo + hi) / 2
low = (b1 * x * z ** b1 + b2 * y * z ** b2) / z
return low, z * low, (x, y, b1, b2)
def hold_value(v, c, k, r=0.08, d=0.06, s=0.35):
low, high, (x, y, b1, b2) = bounds(c, k, r, d, s)
if v <= low:
return 0.0
if v >= high:
return v - k
return x * (v / low) ** b1 + y * (v / low) ** b2 - c / r
if __name__ == "__main__":
k = 6000
print("A. drop and build boundaries by renewal fee (K = 6,000)")
print(" fee/yr PV fees drop L build H H/K")
for c in (0.01, 12, 15, 35, 60, 120):
low, high, _ = bounds(c, k)
print(" {:>7} {:>8,.0f} {:>7,.0f} {:>8,.0f} {:.3f}".format(
c, c / 0.08, low, high, high / k))
print("B. value of keeping one name, fee 15 per year")
print(" V keep value decision")
for v in (50, 100, 200, 400, 800, 1600, 3200, 17500):
w = hold_value(v, 15, k)
low, high, _ = bounds(15, k)
act = "DROP" if v <= low else ("BUILD" if v >= high else "HOLD")
print(" {:>7,} {:>11,.1f} {}".format(v, w, act))Single source and citation
Fan, Y. (2026). Real-Options Valuation of Geo-Exact Domain Portfolios, Optimal Renewal Pruning and the Moats of Organic Search (Version 1.0.0), Chapter 1: Carrying Cost and the Development Option: the Value of Waiting, Renewal Fees and Two Boundaries. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 2 · The Price Evidence: Repeat-Sales Indices, Survivorship Bias and the Cost of Holding
- Chapter 3 · A Finite-Horizon Lattice: Renewing, Lapsing and Building Year by Year
- Chapter 4 · Pruning under a Budget: the Knapsack, the Greedy Ratio and a Ten-Year Back-Test of Policies
- Chapter 5 · Rank, Clicks and Direct Navigation: Where the Moat of a Geo-Exact Name Comes From
- Chapter 6 · Generative Search and Entity Consistency: Only Structured Data that Visitors Can See
- Chapter 7 · Classics East and West: Bai Gui's "Take What Others Discard" and Henry George on Land Speculation
- Chapter 8 · The Annual Renewal Audit and a Plan for Refutation