What does Buyer Pricing, Fee Steps and Accessory Attach conclude, in numbers, about “The Checkout Drawer: Exposure, Discounts and Small Tests”?

Answer: Chapter 4 shows the checkout drawer earning 156.2 times the product page at full price, and discounts only lowering the net.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's 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: 156.2

product page: 1.6 sales, net 1333 per 1000 orders
logistic slope 2.993 per unit of discount
discountattachsalesnet (k = 0)net (k = 1)
0.000.250250208250208250
0.050.279279205819205666
0.100.310310199102198796
0.150.343343187436186978
0.200.378378170197169585
0.250.413413146826146061
0.300.450450116865115948
0.350.4874877998278912
0.400.5255253599034767
best discount 0.00; drawer at d = 0 earns 156.2 times the page
Show the full program
# Chapter 4. p07: The checkout drawer against the product page. On the
# page, an accessory is seen in 0.02 of bag orders and bought in 0.08 of
# those views. In the drawer every checkout sees it; the attach rate is
# logistic in the discount d, calibrated to 0.25 at d = 0 and 0.45 at
# d = 0.30 (an illustrative fit to the 25% to 45% range). A share k of
# drawer buyers would have bought on the page at full price anyway.
# Price 1960, unit cost 1078, fee 0.025. Per 1000 bag orders. No
# sampling.
import math

PRICE, COST, FEE = 1960.0, 1078.0, 0.025
PAGE_SEEN, PAGE_BUY = 0.02, 0.08
A0 = math.log(0.25 / 0.75)
B = (math.log(0.45 / 0.55) - A0) / 0.30

def attach(d):
    return 1.0 / (1.0 + math.exp(-(A0 + B * d)))

def unit(d):
    return PRICE * (1 - d) * (1 - FEE) - COST

def drawer(d, k):
    n = 1000 * attach(d)
    full = 1000 * PAGE_SEEN * PAGE_BUY
    lost = min(k * n, full) * (unit(0.0) - unit(d))
    return n, n * unit(d) - lost

if __name__ == "__main__":
    page = 1000 * PAGE_SEEN * PAGE_BUY
    print("   product page: {:.1f} sales, net {:.0f} per 1000 orders".format(
        page, page * unit(0.0)))
    print("   logistic slope {:.3f} per unit of discount".format(B))
    print("     discount   attach   sales   net (k = 0)   net (k = 1)")
    best = (None, -1.0)
    for i in range(0, 9):
        d = 0.05 * i
        n, v0 = drawer(d, 0.0)
        _, v1 = drawer(d, 1.0)
        if v0 > best[1]:
            best = (d, v0)
        print("     {:8.2f}   {:6.3f}   {:5.0f}   {:11.0f}   {:11.0f}".format(
            d, attach(d), n, v0, v1))
    print("   best discount {:.2f}; drawer at d = 0 earns {:.1f} times"
          " the page".format(best[0], drawer(0.0, 0.0)[1] / (page * unit(0))))

Single source and citation

Fan, Y. (2026). Cross-Border Buyer Dynamic Pricing, Fee-Threshold Payment Routing and Accessory Attach Economics (Version 1.0.0), Chapter 4: The Checkout Drawer: Exposure, Discounts and Small Tests. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-110 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026110,
  author    = {Fan, Yafu},
  title     = {Cross-Border Buyer Dynamic Pricing, Fee-Threshold Payment Routing and Accessory Attach Economics},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book