What does Completion Hazards, Feedback Loops and Funnels conclude, in numbers, about “Reverse Selection by Hook Breadth and the Timing of the Offer”?

Answer: Chapter 4 finds a cash-optimal hook breadth of 0.314 (RM 2,534 a day), while the broadest hook brings 10 times the views of the narrowest and leaves RM 545 a day; an attention-residue model gives a best offer delay of 7.59 seconds, and letting the video finish its story first lifts conversion 1.246 times.

Scope of the numbers: Marked boxes separate evidence, runnable Python programs, classical sources and hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 0.314, 2534, 545

   breadth b     views/day   buyers/day   net cash RM/day
         0.0         2,000         20.0             1,867
         0.2         3,170         28.1             2,435
         0.4         5,024         31.1             2,476
         0.6         7,962         27.1             1,966
         0.8        12,619         18.6             1,205
         1.0        20,000         10.0               545
   best breadth b = 0.314: 4,121 views, 30.7 buyers,
   RM 2,534 a day
   the broadest hook: 4.9 times the views of the best,
   0.33 of its buyers, RM 545 a day
Reading: the cash optimum sits at a modest breadth, well
short of the hook that maximises views. Past it, each extra
view brings more strangers than buyers, refunds rise and
the premium programme sells to fewer of them. The broadest
hook earns about a fifth of the optimum with ten times the
views of the narrowest.
Show the full program
# Chapter 4. p07: Broad hooks, more views, fewer buyers.
# Hook breadth b runs from 0 (a hook that speaks only to the target
# buyer) to 1 (a hook that speaks to everyone). Illustrative model:
#   daily views      V(b) = 2,000 x 10^b        (10 times at b = 1);
#   paid conversion  c(b) = 0.01 x 20^(-b^2)   (20 times lower at b = 1;
#     a slightly broader hook first adds near-buyers, then strangers);
#   entry product RM 49; a share u(b) = 0.2 x 2^(-b) of buyers later
#     buys the RM 298 programme; refunds r(b) = 0.03 + 0.05 b;
#   support cost RM 6 per buyer; fixed cost RM 120 per day.
# Daily net cash = buyers x (49 + u 298) x (1 - r) - 6 buyers - 120.
# The program scans b and finds the best breadth on a fine grid.

def day(b):
    views = 2000 * 10 ** b
    buyers = views * 0.01 * 20 ** (-b * b)
    u = 0.2 * 2 ** (-b)
    r = 0.03 + 0.05 * b
    cash = buyers * (49 + u * 298) * (1 - r) - 6 * buyers - 120
    return views, buyers, cash

if __name__ == "__main__":
    print("   breadth b     views/day   buyers/day   net cash RM/day")
    for i in range(0, 11, 2):
        b = i / 10
        v, n, c = day(b)
        print("   {:9.1f} {:13,.0f} {:12.1f} {:17,.0f}".format(b, v, n, c))
    best = max((day(i / 1000)[2], i / 1000) for i in range(1001))
    v, n, c = day(best[1])
    print("\n   best breadth b = {:.3f}: {:,.0f} views, {:.1f} buyers,"
          .format(best[1], v, n))
    print("   RM {:,.0f} a day".format(c))
    v1, n1, c1 = day(1.0)
    print("   the broadest hook: {:.1f} times the views of the best,"
          .format(v1 / v))
    print("   {:.2f} of its buyers, RM {:,.0f} a day".format(n1 / n, c1))
    print("\nReading: the cash optimum sits at a modest breadth, well")
    print("short of the hook that maximises views. Past it, each extra")
    print("view brings more strangers than buyers, refunds rise and")
    print("the premium programme sells to fewer of them. The broadest")
    print("hook earns about a fifth of the optimum with ten times the")
    print("views of the narrowest.")

Single source and citation

Fan, Y. (2026). Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels (Version 1.0.0), Chapter 4: Reverse Selection by Hook Breadth and the Timing of the Offer. 5D Library. https://doi.org/10.5281/zenodo.24090213

DOI: 10.5281/zenodo.24090213 · Read the monograph · 5DL-B-081 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026081,
  author    = {Fan, Yafu},
  title     = {Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090213},
  url       = {https://doi.org/10.5281/zenodo.24090213}
}

Other chapter answers in this book