What does One-Person Firms, Avatar Livestreams and Task Exposure conclude, in numbers, about “The Cyclic Run-of-Show as a Markov Chain”?

Answer: Chapter 3 writes a looping run-of-show as a Markov chain: with illustrative exit rates the best cycle is about 4.0 minutes, with 32.0 orders per 1,000 viewers.

Scope of the numbers: Revenues, hours, costs, conversion and exit rates, refund rates and job-loss hazards are illustrative or synthetic; all data are generated by its programs; the book is not financial, legal, tax or career advice, and promises no income. Chapter 3 writes a looping run-of-show as a Markov chain: with illustrative exit rates the best cycle is about 4.0 minutes, with 32.0 orders per 1,000 viewers.

中文版

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: 1000, 32.0, 4.0

TP(buy | full demo)stay (min)orders/1,000GMV
3.00.03223.7028.2RM 2,514
3.50.04953.6931.9RM 2,841
4.00.06333.6932.0RM 2,844
4.50.07453.7030.3RM 2,697
5.00.08343.7128.0RM 2,488
5.50.09063.7225.4RM 2,260
6.00.09643.7322.9RM 2,034
6.50.10103.7420.5RM 1,823
7.00.10473.7518.3RM 1,630
7.50.10773.7616.4RM 1,457
8.00.11013.7714.6RM 1,303
best cycle: T = 4.0 min, 32.0 orders per 1,000 viewers
Show the full program
# Chapter 3. p06: Choosing the cycle length T between 3 and 8 minutes.
# Same phases and leaving rates as p05. A longer demonstration persuades
# more, with diminishing returns, and one under 0.8 minutes does not
# work at all: a viewer who saw a demonstration of length D buys at the
# close with probability 0.12 (1 - exp(-(D - 0.8) / 0.8)) (zero if D is
# under 0.8), others with 0.012. Reported per arriving viewer: mean
# stay, orders and GMV (RM 89 an order), for T in steps of half a minute.
import math

SHARE = (0.25, 0.35, 0.15, 0.25)
LEAVE = (0.30, 0.20, 0.20, 0.35)
PART, AOV = 0.012, 89.0

def viewer(a, T, full, cycles=80):
    b = [0.0]
    for s in SHARE:
        b.append(b[-1] + s * T)
    alive, minutes, bought, first = 1.0, 0.0, 0.0, True
    for _ in range(cycles):
        for ph in range(4):
            lo, hi = b[ph], b[ph + 1]
            if first and hi <= a:
                continue
            L = hi - (max(lo, a) if first else lo)
            minutes += alive * (1 - math.exp(-LEAVE[ph] * L)) / LEAVE[ph]
            alive *= math.exp(-LEAVE[ph] * L)
            if ph == 3:
                p = full if (not first or a <= b[1]) else PART
                bought += alive * p
                alive *= 1 - p
                first = False
    return minutes, bought

def per_viewer(T):
    full = 0.12 * (1 - math.exp(-max(0.0, 0.35 * T - 0.8) / 0.8))
    rows = [viewer((i + 0.5) / 600 * T, T, full) for i in range(600)]
    return (sum(r[0] for r in rows) / 600, sum(r[1] for r in rows) / 600,
            full)

if __name__ == "__main__":
    print("     T   P(buy | full demo)   stay (min)   orders/1,000   GMV")
    best = None
    for k in range(6, 17):
        T = k / 2
        m, b, f = per_viewer(T)
        print("   {:4.1f}        {:.4f}           {:5.2f}        {:5.1f}"
              "    RM {:5,.0f}".format(T, f, m, 1000 * b, 1000 * b * AOV))
        if best is None or b > best[1]:
            best = (T, b)
    print("   best cycle: T = {:.1f} min, {:.1f} orders per 1,000 viewers"
          .format(best[0], 1000 * best[1]))

Single source and citation

Fan, Y. (2026). One-Person Enterprise Automation, Avatar Livestream Funnels and Task-Exposure Arbitrage (Version 1.0.0), Chapter 3: The Cyclic Run-of-Show as a Markov Chain. 5D Library. https://doi.org/10.5281/zenodo.24090235

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

BibTeX
@book{fan2026090,
  author    = {Fan, Yafu},
  title     = {One-Person Enterprise Automation, Avatar Livestream Funnels and Task-Exposure Arbitrage},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090235},
  url       = {https://doi.org/10.5281/zenodo.24090235}
}

Other chapter answers in this book