What does Completion Hazards, Feedback Loops and Funnels conclude, in numbers, about “Feedback Loops, the Matthew Effect and Gameable Metrics”?

Answer: Chapter 3 shows recommender feedback magnifying luck into gaps (the Gini coefficient of likes rises from 0.214 to 0.964) and proves that both completion and watch time can be gamed by editing length: the 7-second video with the weakest holding power has the highest completion (0.544), and only normalising by the same-length baseline restores the true order.

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. standard-library Python onlyprinted values that match the answer: 0.214, 0.964

   b     Gini   top share   rank corr   best video first
   0.0    0.214      0.035       0.970          4 of 8
   1.0    0.702      0.186       0.794          1 of 8
   1.5    0.964      0.853       0.621          2 of 8
Reading: without feedback, likes track appeal closely
(rank correlation 0.970), and the best video wins in half the
worlds only because its neighbours are almost as good. With
feedback, early luck is amplified: inequality rises, the link
between appeal and success weakens, and one video can take
most of the likes. Past view counts measure luck as well as
quality.
Show the full program
# Chapter 3. p05: The Matthew effect in a recommender feedback loop.
# 48 videos with fixed appeal q_i spread evenly from 0.2 to 0.8. Each
# of 10,000 viewers is shown one video, chosen with probability
# proportional to (likes_i + 1)^b, and likes it with chance q_i.
# b = 0 is a world with no feedback (independent exposure); b = 1 is a
# Polya urn; b = 1.5 lets popularity compound. For each b we run eight
# independent worlds with the same videos (as Salganik et al. did with
# songs) and report: the Gini coefficient of likes, the share of likes
# held by the top video, the rank correlation of likes with appeal,
# and in how many of the eight worlds the best video came first.
import random

def gini(xs):
    xs = sorted(xs)
    n = len(xs)
    cum = sum((i + 1) * x for i, x in enumerate(xs))
    return (2 * cum) / (n * sum(xs)) - (n + 1) / n

def ranks(xs):
    order = sorted(range(len(xs)), key=lambda i: xs[i])
    r = [0.0] * len(xs)
    for pos, i in enumerate(order):
        r[i] = float(pos)
    return r

def spearman(a, b):
    ra, rb = ranks(a), ranks(b)
    n = len(a)
    ma, mb = sum(ra) / n, sum(rb) / n
    cov = sum((x - ma) * (y - mb) for x, y in zip(ra, rb))
    va = sum((x - ma) ** 2 for x in ra)
    vb = sum((y - mb) ** 2 for y in rb)
    return cov / (va * vb) ** 0.5

def world(b, rng, n=48, viewers=10000):
    q = [0.2 + 0.6 * i / (n - 1) for i in range(n)]
    likes = [0] * n
    for _ in range(viewers):
        w = [(x + 1) ** b for x in likes]
        i = rng.choices(range(n), weights=w)[0]
        if rng.random() < q[i]:
            likes[i] += 1
    return q, likes

if __name__ == "__main__":
    rng = random.Random(1968)
    print("   b     Gini   top share   rank corr   best video first")
    for b in (0.0, 1.0, 1.5):
        g = t = c = 0.0
        wins = 0
        for _ in range(8):
            q, likes = world(b, rng)
            g += gini(likes) / 8
            t += max(likes) / sum(likes) / 8
            c += spearman(q, likes) / 8
            wins += likes.index(max(likes)) == len(q) - 1
        print("   {:3.1f} {:8.3f} {:10.3f} {:11.3f} {:10d} of 8".format(
            b, g, t, c, wins))
    print("\nReading: without feedback, likes track appeal closely")
    print("(rank correlation 0.970), and the best video wins in half the")
    print("worlds only because its neighbours are almost as good. With")
    print("feedback, early luck is amplified: inequality rises, the link")
    print("between appeal and success weakens, and one video can take")
    print("most of the likes. Past view counts measure luck as well as")
    print("quality.")

Single source and citation

Fan, Y. (2026). Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels (Version 1.0.0), Chapter 3: Feedback Loops, the Matthew Effect and Gameable Metrics. 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