5D Library › Order-Bump Friction Elasticity, One-Click Upsell Kinetics and Cross-Domain Recommendation Matrices · 中文
Chapter 1. The Zero-Friction Arbitrage of the Order Bump
A decision that takes one tick
When a buyer opens checkout, the decision on the main item is already made. A related small item placed on the page now needs only a tick, with no payment details to re-enter: the marginal friction of the bump is close to zero. The program sets the main item at RM 98 and lets a buyer value the bump at the main price times a lognormal variable (median 0.45, log standard deviation 0.8, illustrative); the take rate is the probability that the value exceeds “price + friction”.
Calculation
# Chapter 1. p01: The order bump - optimal price ratio and take rate.
# At checkout the buyer has decided on the main item (price P = RM 98).
# The bump's value to a buyer is V = P x U, U lognormal (median 0.45,
# log-s.d. 0.8). Taking it costs the price p plus a friction kappa: near
# zero at checkout (one tick), larger later (re-entering card details).
# Take rate t(p) = P(V > p + kappa); bump revenue per order = p t(p).
from math import log, erf, sqrt
P = 98.0
def take(p, kappa=0.0, med=0.45, sd=0.8):
x = (p + kappa) / P
return 0.5 * (1 - erf((log(x) - log(med)) / sd / sqrt(2)))
def best(kappa=0.0, **kw):
grid = [P * r / 1000 for r in range(50, 1500)]
p = max(grid, key=lambda q: q * take(q, kappa, **kw))
return p, take(p, kappa, **kw)
if __name__ == "__main__":
for kappa in (0.0, 10.0, 25.0):
p, t = best(kappa)
print(" friction RM {:4.1f}: best bump RM {:6.2f} (ratio {:.3f}),"
" take {:.3f}".format(kappa, p, p / P, t))
print(" added to average order value: {:+.1%}".format(p * t / P))
print(" ratio range over medians 0.30-0.60 and log-s.d. 0.6-1.0:")
rs = []
for med in (0.30, 0.45, 0.60):
for sd in (0.6, 0.8, 1.0):
p, t = best(0.0, med=med, sd=sd)
rs.append((p / P, p * t / P))
print(" ratio {:.3f} to {:.3f}; AOV lift {:+.1%} to {:+.1%}".format(
min(r for r, _ in rs), max(r for r, _ in rs),
min(a for _, a in rs), max(a for _, a in rs)))
# friction RM 0.0: best bump RM 44.20 (ratio 0.451), take 0.499
# added to average order value: +22.5%
# friction RM 10.0: best bump RM 44.79 (ratio 0.457), take 0.393
# added to average order value: +18.0%
# friction RM 25.0: best bump RM 47.04 (ratio 0.480), take 0.270
# added to average order value: +12.9%
# ratio range over medians 0.30-0.60 and log-s.d. 0.6-1.0:
# ratio 0.246 to 0.812; AOV lift +15.0% to +31.0%With zero friction the price maximising bump revenue is RM 44.20, a ratio of 0.451, with take rate 0.499, raising average order value by 22.5%. If the same item had to be bought separately afterwards (friction RM 10, re-entering a card, say), the best price barely changes but the take rate falls to 0.393 and the contribution to 18.0%; with friction RM 25 only 12.9% remains. That is what the “zero-friction arbitrage” means: what is saved is not price but the cost of making another purchase decision.
The optimal price ratio is not a universal constant. As the median valuation varies from 0.30 to 0.60 and the log standard deviation from 0.6 to 1.0, the optimal ratio ranges from 0.246 to 0.812 and the contribution to order value from +15.0% to +31.0%. It is set by how buyers value the bump and has to be measured on one’s own traffic (Chapter 6).
One or two
Calculation
# Chapter 1. p02: One bump or two, and the cost to the main checkout.
# Each bump b has relative value U_b lognormal (medians 0.45 and 0.30,
# log-s.d. 0.8, correlation rho between the two log-values). Each bump
# shown lowers completion of the main checkout by a share delta (an extra
# decision on the page). Revenue per buyer who opens checkout:
# (1 - delta n) (P + sum of bump prices x takes).
import random
from math import log, exp, sqrt
P = 98.0
def simulate(prices, meds, rho, delta, n=200000, seed=78002):
rng = random.Random(seed)
rev = takes0 = takes1 = 0.0
for _ in range(n):
z0 = rng.gauss(0, 1)
z1 = rho * z0 + sqrt(1 - rho * rho) * rng.gauss(0, 1)
vals = [P * meds[0] * exp(0.8 * z0), P * meds[1] * exp(0.8 * z1)]
r = P
for i, p in enumerate(prices):
if vals[i] > p:
r += p
if i == 0:
takes0 += 1
else:
takes1 += 1
rev += r
keep = 1 - delta * len(prices)
return keep * rev / n, takes0 / n, takes1 / n
if __name__ == "__main__":
print(" bumps rho delta takes revenue/opened vs none")
base = P
for prices, rho, delta in (((44.0,), 0.0, 0.01),
((44.0, 29.0), 0.0, 0.01),
((44.0, 29.0), 0.5, 0.01),
((44.0, 29.0), 0.5, 0.03)):
r, t0, t1 = simulate(prices, (0.45, 0.30), rho, delta)
print(" {:5d} {:.1f} {:5.2f} {:.3f} {:.3f} {:14.2f} {:+.1%}"
.format(len(prices), rho, delta, t0,
t1 if len(prices) > 1 else 0, r, r / base - 1))
# bumps rho delta takes revenue/opened vs none
# 1 0.0 0.01 0.501 0.000 118.85 +21.3%
# 2 0.0 0.01 0.501 0.505 132.01 +34.7%
# 2 0.5 0.01 0.501 0.506 132.04 +34.7%
# 2 0.5 0.03 0.501 0.506 126.65 +29.2%The program puts one bump (RM 44) or two (RM 44 and RM 29) on the checkout page and assumes each extra bump lowers completion of the main purchase by . With , one bump raises revenue per checkout opened from RM 98 to RM 118.85 (+21.3%), two bumps to RM 132.01 (+34.7%); if each extra option costs 0.03 of completion, two bumps give only +29.2%. In this model the correlation of the two bump valuations does not change revenue, because the two items are priced and accepted separately.
Note
A bump must be ticked by the buyer. A pre-ticked bump makes some buyers pay without knowing, a documented dark pattern that also brings refunds and chargebacks (Volume 77, Chapter 5). This chapter’s model applies only to bumps unticked by default with a clearly visible price.
Summary
The advantage of the checkout bump comes from zero friction: in the illustrative model the best price ratio is 0.451 with a take rate of 0.499, adding 22.5% to order value; the best ratio varies from 0.246 to 0.812 with the valuation distribution. A second bump adds another ten-odd per cent, but every extra option is paid for out of completion of the main purchase.
Fan, Y. (2026). Order-Bump Friction Elasticity, One-Click Upsell Kinetics and Cross-Domain Recommendation Matrices: Zero-Reentry Impulse Attachment, Conditional Mutual Information and Cart-Value Multipliers [结账顺手加购弹性、一键升单动力学与跨领域推荐矩阵] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090207 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).