What does Pricing for Lower-Tier Cities conclude, in numbers, about “Multi-Tier Package Anchors: Self-Selection Menus, Price Endings and a Real-Anchor Audit”?

Answer: Chapter 6 prices a three-rung menu by self-selection: fourth-tier prices relative to the first tier are 0.592 for basic, 0.666 for standard and 0.719 for premium, and five rules audit the anchors, catching invented original prices and decoys.

Scope of the numbers: Its city tiers, incomes, price levels, costs and demand parameters are illustrative, and it quotes no specific official statistic; all calculations are generated by its programs; it is not individual business advice. 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: 0.592, 0.666, 0.719

tier basic stand prem | share b s p | prem/basic gain
T185712691693| 0.202 0.069 0.153 |1.9750.278
T267510391426| 0.225 0.062 0.104 |2.1120.233
T35749191293| 0.221 0.049 0.070 |2.2530.207
T45088461218| 0.197 0.035 0.046 |2.4000.192
T4 price / T1 price: basic 0.592, standard 0.666, premium 0.719
Show the full program
# Chapter 6. p61: a three-package menu per tier, priced by self-selection.
# A resident's value of the basic package is W = 0.03 * D(x) * tau (p12
# model); the standard and premium packages are worth V = 1.30 and 1.55
# times as much and cost C = 250 and 450 yuan against 90 for basic. Each
# resident takes the package with the largest V * W - price, or nothing.
# Choice is constant between break points of W, so each share is the
# lognormal taste mass between two cut-offs, averaged over 200 income
# quantiles. Prices are found by rounds of golden-section search: all
# three scaled together, then each in ladder order.
# All parameters are illustrative.
import math
from statistics import NormalDist

N01 = NormalDist()
TIERS = ["T1", "T2", "T3", "T4"]
MED = [72000, 50000, 36000, 26000]
SIG = [0.55, 0.58, 0.64, 0.72]
P = [1.00, 0.90, 0.82, 0.76]
E = [0.38, 0.34, 0.31, 0.29]
V = [1.00, 1.30, 1.55]
C = [90.0, 250.0, 450.0]
NAMES = ["basic", "standard", "premium"]
NQ = 200


def disc(x, k):
    w = 0.28 - 0.09 * math.log(x / (P[k] * 72000))
    w = min(0.65, max(0.10, w))
    return x * max(0.0, 1.0 - w - E[k])


def lwgrid(k):
    # log of 0.03 * D at NQ income quantiles (residents with D > 0)
    out = []
    for i in range(NQ):
        d = disc(MED[k] * math.exp(SIG[k] * N01.inv_cdf((i + 0.5) / NQ)),
                 k)
        if d > 0:
            out.append(math.log(0.03 * d))
    return out


def above(t, lw):
    # share of residents whose basic-package value W exceeds t
    if t <= 0:
        return 1.0
    if t == math.inf:
        return 0.0
    lt = math.log(t)
    return math.fsum(1.0 - N01.cdf((lt - x) / 0.45) for x in lw) / NQ


def shares(pr, lw):
    bps = {pr[j] / V[j] for j in range(3)}
    for a in range(3):
        for b in range(a + 1, 3):
            bps.add((pr[b] - pr[a]) / (V[b] - V[a]))
    cuts = [0.0] + sorted(b for b in bps if b > 0) + [math.inf]
    parts = [[], [], []]
    for lo, hi in zip(cuts[:-1], cuts[1:]):
        rep = lo + 1.0 if hi == math.inf else (lo + hi) / 2.0
        u = [V[j] * rep - pr[j] for j in range(3)]
        j = max(range(3), key=lambda m: u[m])
        if u[j] >= 0:
            parts[j].append(above(lo, lw) - above(hi, lw))
    return [math.fsum(x) for x in parts]


def profit(pr, lw):
    s = shares(pr, lw)
    return 1000.0 * math.fsum(s[j] * (pr[j] - C[j]) for j in range(3))


def golden(f, a, b, n=40):
    r = (math.sqrt(5.0) - 1.0) / 2.0
    for _ in range(n):
        x1, x2 = b - r * (b - a), a + r * (b - a)
        if f(x1) < f(x2):
            a = x1
        else:
            b = x2
    return (a + b) / 2.0


def solve(lw, start):
    # each round: scale all three prices together, then one at a time
    pr = [start * v for v in V]
    for _ in range(6):
        base = list(pr)
        lo = max(0.6, (C[0] + 1.0) / base[0], (C[2] + 1.0) / base[2])
        s = golden(lambda v: profit([p * v for p in base], lw), lo, 1.6)
        pr = [p * s for p in base]
        for j in range(3):
            lo = C[j] + 1.0 if j == 0 else max(C[j] + 1.0, pr[j - 1])
            hi = 6000.0 if j == 2 else pr[j + 1]

            def f(v, j=j):
                q = list(pr)
                q[j] = v
                return profit(q, lw)
            pr[j] = golden(f, lo, max(lo, hi))
    return pr


SINGLE = [857, 675, 574, 508]
print("tier  basic  stand  prem  | share b   s     p   | prem/basic  "
      "gain")
MENUS = []
for k, t in enumerate(TIERS):
    lw = lwgrid(k)
    pr = solve(lw, SINGLE[k])
    MENUS.append(pr)
    s = shares(pr, lw)
    one = profit([SINGLE[k], 1e9, 1e9], lw)
    print("%-4s  %4.0f   %4.0f  %4.0f  | %.3f %.3f %.3f |   %.3f     %.3f"
          % (t, pr[0], pr[1], pr[2], s[0], s[1], s[2], pr[2] / pr[0],
             profit(pr, lw) / one - 1.0))
print("T4 price / T1 price: " + ", ".join(
    "%s %.3f" % (NAMES[j], MENUS[3][j] / MENUS[0][j]) for j in range(3)))

Single source and citation

Fan, Y. (2026). Purchasing-Power Parity across Provinces and Pricing for Lower-Tier Cities: Income Distributions, Engel-Coefficient Calibration and Multi-Tier Package Anchors (Version 1.0.0), Chapter 6: Multi-Tier Package Anchors: Self-Selection Menus, Price Endings and a Real-Anchor Audit. 5D Library. DOI pending

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

BibTeX
@book{fan2026275,
  author    = {Fan, Yafu},
  title     = {Purchasing-Power Parity across Provinces and Pricing for Lower-Tier Cities: Income Distributions, Engel-Coefficient Calibration and Multi-Tier Package Anchors},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book