5D Library › One-Person Enterprise Automation, Avatar Livestream Funnels and Task-Exposure Arbitrage · 中文

Chapter 3. The Cyclic Run-of-Show as a Markov Chain

A script that repeats

Live-stream selling often runs a fixed script in a loop: a hook that names the viewer’s problem, a demonstration of the product, a price anchor (“usually … today …”), and a closing call with a time limit. Viewers arrive at random moments and leave at rates that depend on what is on screen; trust built by the host’s presence and demonstration is what turns watching into buying (Wongkitrungrueng and Assarut 2020). Treated as a chain of phases with exit rates, the loop can be solved exactly. In the base case a cycle lasts 6 minutes; a viewer who saw this cycle’s demonstration from its start buys at the close with probability 0.05, others with 0.012.

Calculation

# Chapter 3. p05: A cyclic run-of-show and the viewer who arrives at a
# random moment. One cycle of T = 6 minutes: hook 25%, demonstration
# 35%, price anchor 15%, closing call 25% of T. Viewers leave at rates
# of 0.30, 0.20, 0.20 and 0.35 a minute in the four phases. At the end
# of each close, a viewer still present buys with probability 0.05 if
# she has seen this cycle's demonstration from its start, otherwise
# 0.012, and buyers leave (order value RM 89). Arrival times are spread
# evenly over the cycle (600 points); survival is exact (exponential
# within each phase).
import math

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

def viewer(a, T, full=FULL, part=PART, cycles=60):
    """Arrival at time a in [0, T); returns (expected minutes, P(buy))."""
    bounds = [0.0]
    for s in SHARE:
        bounds.append(bounds[-1] + s * T)
    alive, minutes, bought = 1.0, 0.0, 0.0
    first = True
    for c in range(cycles):
        for ph in range(4):
            lo, hi = bounds[ph], bounds[ph + 1]
            if first and hi <= a:
                continue
            start = max(lo, a) if first else lo
            L, h = hi - start, LEAVE[ph]
            minutes += alive * (1 - math.exp(-h * L)) / h
            alive *= math.exp(-h * L)
            if ph == 3:
                saw = (not first) or a <= bounds[1]
                p = full if saw else part
                bought += alive * p
                alive *= 1 - p
                first = False
    return minutes, bought

def average(T, **kw):
    pts = [(i + 0.5) / 600 * T for i in range(600)]
    rows = [viewer(a, T, **kw) for a in pts]
    return (sum(r[0] for r in rows) / 600, sum(r[1] for r in rows) / 600)

if __name__ == "__main__":
    m, b = average(6.0)
    print("   T = 6 min: mean stay {:.2f} min, buys {:.4f} per viewer"
          .format(m, b))
    print("     per 1,000 viewers: {:.1f} orders, GMV RM {:,.0f}".format(
        1000 * b, 1000 * b * AOV))
    for name, a in (("during hook", 0.75), ("during demo", 2.25),
                    ("during close", 5.25)):
        m1, b1 = viewer(a, 6.0)
        print("   arrives {:12s}: stays {:.2f} min, buys {:.4f}".format(
            name, m1, b1))
#    T = 6 min: mean stay 3.77 min, buys 0.0144 per viewer
#      per 1,000 viewers: 14.4 orders, GMV RM 1,280
#    arrives during hook : stays 3.92 min, buys 0.0161
#    arrives during demo : stays 3.97 min, buys 0.0093
#    arrives during close: stays 3.55 min, buys 0.0190

The average viewer stays 3.77 minutes and buys with probability 0.0144: 14.4 orders and RM 1,280 of GMV per 1,000 viewers. When a viewer arrives matters: one who comes during the hook buys with probability 0.0161, one who comes in the middle of the demonstration only 0.0093, and one who comes during the close 0.0190, because she reaches a close quickly and then sees a full cycle. Arriving mid-demonstration is the worst moment: the viewer meets a sales call without its reasons and must survive a whole cycle to see them.

How long should one cycle be?

A longer demonstration persuades more, but fewer viewers are still there at the close. In the next model a demonstration shorter than 0.8 minutes does not persuade at all, and beyond that persuasion rises with diminishing returns.

Calculation

# 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]))
#      T   P(buy | full demo)   stay (min)   orders/1,000   GMV
#     3.0        0.0322            3.70         28.2    RM 2,514
#     3.5        0.0495            3.69         31.9    RM 2,841
#     4.0        0.0633            3.69         32.0    RM 2,844
#     4.5        0.0745            3.70         30.3    RM 2,697
#     5.0        0.0834            3.71         28.0    RM 2,488
#     5.5        0.0906            3.72         25.4    RM 2,260
#     6.0        0.0964            3.73         22.9    RM 2,034
#     6.5        0.1010            3.74         20.5    RM 1,823
#     7.0        0.1047            3.75         18.3    RM 1,630
#     7.5        0.1077            3.76         16.4    RM 1,457
#     8.0        0.1101            3.77         14.6    RM 1,303
#    best cycle: T = 4.0 min, 32.0 orders per 1,000 viewers

At a 3-minute cycle the demonstration is too short (a buyer who saw it all buys with probability 0.0322) and the stream makes 28.2 orders per 1,000 viewers. The best cycle is 4.0 minutes, with 32.0 orders and RM 2,844 of GMV per 1,000 viewers; 3.5 and 4.5 minutes are close (31.9 and 30.3). By 8 minutes the demonstration persuades more than three times as well (0.1101), but only 14.6 orders per 1,000 viewers remain, because most viewers have left before the close. With these exit rates the optimum sits at the short end of the 3 to 8 minute range; slower exits move it longer.

Orders per 1,000 arriving viewers against cycle length (p06).

Note

No pressure tactics. The model counts viewers who choose to buy after seeing a demonstration. False scarcity (“only 3 left” when there are more), fake countdowns or invented original prices are deceptive and in many places unlawful; they are not part of the run-of-show studied here.

Summary

A looping run-of-show is a Markov chain over its phases. Viewers who arrive mid-demonstration buy least. With illustrative exit rates the best cycle is about 4.0 minutes (32.0 orders per 1,000 viewers), and both shorter and longer cycles lose orders.

References

Wongkitrungrueng, Apiradee, and Nuttapol Assarut. 2020. “The Role of Live Streaming in Building Consumer Trust and Engagement with Social Commerce Sellers.” Journal of Business Research 117: 543 to 556.

Fan, Y. (2026). One-Person Enterprise Automation, Avatar Livestream Funnels and Task-Exposure Arbitrage: Coasean Transaction-Cost Collapse, Cyclic Script Retention and High-Margin Solopreneur Portfolios [一人公司自动化架构、数字人直播漏斗与任务级人工智能套利] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090235 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).