What does Pareto Whales and VIP Tiers conclude, in numbers, about “Displaying the Tiers and Sizing the VIP Layer: Decoys, Compromise and Queues”?

Answer: Chapter 6 shows with a multinomial logit that the direction of decoy and compromise effects depends on a parameter to be estimated, sizes a VIP consultant desk with Erlang C, one consultant serving 23 members and four serving 176, and shows that the VIP tier's cost multiple rises faster than its price multiple.

Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is general business analysis, not personalised legal, tax or financial advice, and it promises no income to anyone.

中文版

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: 176, 23

staffmax membersservice levelutilisation
1230.9050.431
2720.9040.675
31230.9060.769
41760.9010.825
60 members on 2 staff: level 0.961, utilisation 0.562
Show the full program
# Chapter 6. p62: how many VIP members a concierge desk can promise to
# serve, from the Erlang C queue (Gans, Koole and Mandelbaum 2003).
# Model: each member sends 0.5 requests per week; 40 desk hours a week
# per concierge; a request takes 1.5 hours on average (exponential).
# Arrival rate per desk hour = members * 0.5 / 40. With c concierges,
# P(wait > t) = C(c, a) * exp(-(c * mu - lam) * t), a = lam / mu. The
# promise: 90 percent of requests start within 4 desk hours, and
# utilisation stays at or below 0.85. Figures are illustrative.
import math

MU = 1.0 / 1.5
T_WAIT = 4.0


def erlang_c(c, a):
    if a >= c:
        return 1.0
    terms = [a ** k / math.factorial(k) for k in range(c)]
    last = a ** c / math.factorial(c) * c / (c - a)
    return last / (math.fsum(terms) + last)


def service_level(members, c):
    lam = members * 0.5 / 40.0
    a = lam / MU
    if a >= c:
        return 0.0, a / c
    pw = erlang_c(c, a)
    return 1.0 - pw * math.exp(-(c * MU - lam) * T_WAIT), a / c


if __name__ == "__main__":
    print("staff  max members  service level  utilisation")
    for c in (1, 2, 3, 4):
        best = 0
        for m in range(1, 1000):
            sl, u = service_level(m, c)
            if sl >= 0.9 and u <= 0.85:
                best = m
        sl, u = service_level(best, c)
        print("{:>5}  {:>11}  {:>13.3f}  {:>11.3f}".format(c, best, sl, u))
    sl, u = service_level(60, 2)
    print("60 members on 2 staff: level {:.3f}, utilisation {:.3f}".format(
        sl, u))

Single source and citation

Fan, Y. (2026). Pareto Whale Auto-Detection, High-Net-Worth Self-Selection Signals and Ten-X VIP Tier Escalation (Version 1.0.0), Chapter 6: Displaying the Tiers and Sizing the VIP Layer: Decoys, Compromise and Queues. 5D Library. DOI pending

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

BibTeX
@book{fan2026399,
  author    = {Fan, Yafu},
  title     = {Pareto Whale Auto-Detection, High-Net-Worth Self-Selection Signals and Ten-X VIP Tier Escalation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book