5D Library › Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata · 中文

Chapter 4. What Pain-Point Agitation Buys and Costs, and Two Guardrails

What “sequential pain-point agitation” is

“Pain-point agitation” on a sales page means amplifying a fear or a pain before the product is offered: “if this year’s gap in your wealth cycle is not filled …”, “this feeling means your metabolism has already …”. That it raises immediate conversion is not in dispute. This chapter asks three other things: how much refund and churn it brings, how much profit is left after them, and whom it brings in among the buyers.

The EU Unfair Commercial Practices Directive classes practices that use harassment, coercion or undue influence to significantly impair consumers’ freedom of choice as “aggressive commercial practices” (Articles 8 and 9) (European Parliament and Council of the European Union 2005); the OECD groups online interface designs that manipulate consumer choices as “dark commercial patterns” (OECD 2022). This chapter’s model does not discuss how the law applies; it computes the economic consequences, but readers should know that this boundary exists.

Gains and costs

Let the agitation intensity aa lie between 0 and 1. Ordinary visitors convert at 0.04+0.08a0.04 + 0.08 a; 10% of visitors are in acute distress (job loss, illness, a break-up) and respond to agitation three times as strongly. The first purchase is 99; the share of refunds and chargebacks rises with the square of aa, each with a fee of 15 on top; a buyer’s repeat purchases over a year are worth 240, and the chance she stays falls with aa (regret drives churn).

Calculation

# Chapter 4. [p07] Pain-point agitation: what it buys and what it costs.
# Agitation intensity a in [0, 1] (how hard a sales page stirs up a
# fear or a pain). Per visitor: conversion c(a) = 0.04 + 0.08 a for
# ordinary visitors; 10% of visitors are in acute distress and convert
# at 0.04 + 0.24 a. First purchase 99; refund or chargeback share
# phi(a) = 0.05 + 0.35 a^2, each costing a 15 fee on top of the refund;
# buyers stay for repeat purchases worth 240 over a year with
# probability 0.6 - 0.3 a (regret drives churn). Reported per 1,000
# visitors: net revenue, and the share of buyers who were in distress.
def per_thousand(a):
    c_ord = 0.04 + 0.08 * a
    c_dis = 0.04 + 0.24 * a
    buyers = 1000 * (0.9 * c_ord + 0.1 * c_dis)
    phi = 0.05 + 0.35 * a * a
    first = buyers * ((1 - phi) * 99 - phi * 15)
    repeat = buyers * (1 - phi) * (0.6 - 0.3 * a) * 240
    distress = 100 * c_dis / buyers
    return first, repeat, first + repeat, buyers, distress

if __name__ == "__main__":
    print("     a   buyers  first net  repeat net  total net"
          "  distressed share")
    rows = []
    for k in range(0, 11):
        a = k / 10
        f, r, t, b, d = per_thousand(a)
        rows.append((t, a))
        print("   {:3.1f} {:8.1f} {:10.0f} {:11.0f} {:10.0f} {:17.3f}".format(
            a, b, f, r, t, d))
    first_best = max(range(0, 101),
                     key=lambda k: per_thousand(k / 100)[0]) / 100
    total_best = max(range(0, 101),
                     key=lambda k: per_thousand(k / 100)[2]) / 100
    print("   best a for first-purchase revenue only: {:.2f}".format(
        first_best))
    print("   best a counting refunds and repeat business: {:.2f}".format(
        total_best))
    print("\nReading: refunds and churn pull the optimum down, but not")
    print("to zero: on its own the market still rewards fairly strong")
    print("agitation, and the harder it is, the larger the share of")
    print("buyers who are in acute distress. Limits have to be set.")
#      a   buyers  first net  repeat net  total net  distressed share
#    0.0     40.0       3732        5472       9204             0.100
#    0.1     49.6       4608        6422      11030             0.129
#    0.2     59.2       5429        7181      12610             0.149
#    0.3     68.8       6172        7735      13907             0.163
#    0.4     78.4       6814        8074      14889             0.173
#    0.5     88.0       7333        8197      15530             0.182
#    0.6     97.6       7704        8107      15811             0.189
#    0.7    107.2       7906        7811      15717             0.194
#    0.8    116.8       7915        7326      15241             0.199
#    0.9    126.4       7708        6672      14380             0.203
#    1.0    136.0       7262        5875      13138             0.206
#    best a for first-purchase revenue only: 0.75
#    best a counting refunds and repeat business: 0.63
#
# Reading: refunds and churn pull the optimum down, but not
# to zero: on its own the market still rewards fairly strong
# agitation, and the harder it is, the larger the share of
# buyers who are in acute distress. Limits have to be set.
Agitation intensity and net revenue per 1,000 visitors, with the share of buyers in distress.

Judged on the first sale alone, the best intensity is 0.75; with refunds and repeat business counted it falls to 0.63, but not to zero: in this model the market by itself still rewards fairly strong agitation. Meanwhile the share of buyers in distress rises from 0.100 without agitation to 0.206 at full intensity. The stronger the agitation, the more the business depends on the most vulnerable people.

Two guardrails

The program compares two guardrails. One is a 7-day cooling-off period in which any buyer may return the first purchase without giving a reason; the regret agitation creates turns into returns as the emotion fades. The other is a distress screen: visitors in acute distress are shown no agitating content.

Calculation

# Chapter 4. [p08] Two guardrails: a cooling-off refund and a distress
# screen. Model of p07. (i) Cooling-off: every buyer may return the
# first purchase within 7 days, no questions asked; regret surfaces as
# the agitation fades, so the share returning is 0.05 + 0.50 a (no
# fee). (ii) Distress screen: visitors in acute distress are shown
# no sales page with agitation (they convert at 0.04 whatever a).
# The best agitation level and net revenue per 1,000 visitors under
# each regime.
def net(a, cooling, screen):
    c_ord = 0.04 + 0.08 * a
    c_dis = 0.04 if screen else 0.04 + 0.24 * a
    buyers = 1000 * (0.9 * c_ord + 0.1 * c_dis)
    if cooling:
        back = 0.05 + 0.50 * a
        first = buyers * (1 - back) * 99
    else:
        back = 0.05 + 0.35 * a * a
        first = buyers * ((1 - back) * 99 - back * 15)
    repeat = buyers * (1 - back) * (0.6 - 0.3 * a) * 240
    return first + repeat, 100 * c_dis / buyers

if __name__ == "__main__":
    print("   regime                      best a   net/1,000   distressed")
    for name, c, s in (("no guardrail (p07)", False, False),
                       ("cooling-off", True, False),
                       ("distress screen", False, True),
                       ("cooling-off + screen", True, True)):
        k = max(range(0, 101), key=lambda k: net(k / 100, c, s)[0])
        v, d = net(k / 100, c, s)
        print("   {:26s} {:7.2f} {:11.0f} {:12.3f}".format(
            name, k / 100, v, d))
    v0, d0 = net(0.0, True, True)
    print("   cooling-off + screen at a = 0: net {:.0f}".format(v0))
    print("\nReading: each guardrail lowers the best level of agitation;")
    print("together they cut the share of buyers in distress to about")
    print("a twentieth, at a cost in net revenue. That cost is the price")
    print("of not selling to people in distress.")
#    regime                      best a   net/1,000   distressed
#    no guardrail (p07)            0.63       15822        0.190
#    cooling-off                   0.52       12754        0.183
#    distress screen               0.57       13488        0.049
#    cooling-off + screen          0.43       11059        0.056
#    cooling-off + screen at a = 0: net 9234
#
# Reading: each guardrail lowers the best level of agitation;
# together they cut the share of buyers in distress to about
# a twentieth, at a cost in net revenue. That cost is the price
# of not selling to people in distress.

Each guardrail lowers the best intensity: the cooling-off period to 0.52, the distress screen to 0.57, both together to 0.43. The screen cuts the share of buyers in distress from 0.190 to 0.049, both together to 0.056. The cost is net revenue: from 15822 down to 11059 (per 1,000 visitors). That difference is the price of not selling to people in distress.

Hypothesis · not established

The author’s interpretation (not yet tested): for a reading company, a cooling-off period and a distress screen are not costs but conditions of staying in business: without them, platform complaints, payment-processor risk controls and regulators sooner or later impose the same limits at a higher price. What would show this wrong: if long-run data show that comparable services without guardrails met no significant complaints or channel restrictions over three years and kept their repeat business, the business case for the guardrails fails and only the ethical case remains. The author holds that the ethical case is enough on its own.

Summary

Judged on the first sale, pain-point agitation looks better the stronger it is; with refunds and churn counted its best intensity falls, but not to zero by itself, and stronger agitation raises the share of buyers in distress. Together, a cooling-off period and a distress screen bring that share down to 0.056, at a cost of about three tenths of net revenue.

References

European Parliament and Council of the European Union. 2005. Directive 2005/29/EC of 11 May 2005 Concerning Unfair Business-to-Consumer Commercial Practices in the Internal Market (Unfair Commercial Practices Directive). Official Journal of the European Union, l 149, 11 June 2005.
OECD. 2022. Dark Commercial Patterns. OECD Digital Economy Papers No. 336. OECD Publishing.

Fan, Y. (2026). Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata: Bayesian Trust Avalanches, Sunk-Cost Commitment Ratchets and Cross-Domain Transition Matrices [回溯信念锁定、序贯痛点唤醒与马尔可夫升单自动机] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090186 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).