What does Blue-Ocean Keywords and Thematic Bundles conclude, in numbers, about “Seven Keyword Slots: a Compliance Filter and an Exact Knapsack”?
Answer: The sweep over the decay factor points the same way. With a factor of 0.3, meaning that same-intention phrases duplicate each other heavily, the exact optimum beats the naive set by 1.067; with 0.9, meaning that same-intention phrases are nearly independent, the advantage shrinks to 1.027. The heavier the overlap, the more the top-seven habit loses.
Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is general business analysis, not personalised business, legal or tax advice, and it promises no income; the catalogue is described publicly only as the 100 published titles, with "more than 330 manuscripts" as an on-site statement.
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: 0.3, 0.9, 1.027, 1.067
| sets searched | 792 |
| exact value 8.850, intents 5 | |
| information goods bundling | 2.94 bundle |
| left digit price effect | 2.43 psych |
| zipf law | 1.43 demand |
| bundle pricing math | 1.10 bundle |
| jaccard similarity | 0.70 cluster |
| screening menu design | 0.60 psych |
| chargeback ratio | 0.55 ops |
| greedy value 8.850 | |
| naive value 8.422, intents 4 | |
| information goods bundling | 2.94 bundle |
| left digit price effect | 2.43 psych |
| zipf law | 1.43 demand |
| bundle pricing math | 1.10 bundle |
| mixed bundling | 0.90 bundle |
| long tail sales | 0.80 demand |
| jaccard similarity | 0.70 cluster |
| exact over naive | 1.051 |
| decay exact greedy naive exact/naive | |
| 0.3 | 8.450 8.450 7.920 1.067 |
| 0.6 | 8.850 8.850 8.422 1.051 |
| 0.9 | 9.250 9.250 9.005 1.027 |
Show the full program
# Chapter 3. p32: choosing seven KDP keyword slots as a small knapsack.
# Input: the twelve phrases kept by p31, each with an illustrative
# expected weekly sales E (scored as in p22) and a search-intent group.
# Set value: phrases are taken in descending E; each phrase adds
# E * (share of its words not yet in title or earlier phrases)
# * DECAY^(number of earlier phrases in the same intent)
# because overlapping words and same-intent phrases reach the same
# shoppers. Exact optimum over all C(12, 7) sets versus a greedy pass
# and the naive "top seven by E". All data illustrative.
import itertools
import math
DECAY = 0.6
TITLE = set("niche keyword positioning thematic bundle direct sales".split())
PH = [
("information goods bundling", 2.94, "bundle"),
("bundle pricing math", 1.10, "bundle"),
("left digit price effect", 2.43, "psych"),
("zipf law", 1.43, "demand"),
("price discrimination", 0.30, "psych"),
("long tail sales", 0.80, "demand"),
("mixed bundling", 0.90, "bundle"),
("screening menu design", 0.60, "psych"),
("refund rate model", 0.40, "ops"),
("chargeback ratio", 0.55, "ops"),
("jaccard similarity", 0.70, "cluster"),
("poisson cash flow", 0.35, "ops"),
]
def value(idx, decay=DECAY):
seen = set(TITLE)
per = {}
parts = []
for i in sorted(idx, key=lambda j: -PH[j][1]):
words = PH[i][0].split()
fresh = len([w for w in words if w not in seen]) / len(words)
k = per.get(PH[i][2], 0)
parts.append(PH[i][1] * fresh * decay ** k)
per[PH[i][2]] = k + 1
seen.update(words)
return math.fsum(parts)
def greedy(k=7, decay=DECAY):
pick = []
for _ in range(k):
best = max((j for j in range(len(PH)) if j not in pick),
key=lambda j: (value(pick + [j], decay), -j))
pick.append(best)
return pick
def show(name, idx):
groups = sorted({PH[i][2] for i in idx})
print("{:<8} value {:.3f}, intents {}".format(
name, value(idx), len(groups)))
for i in sorted(idx, key=lambda j: -PH[j][1]):
print(" {:<28} {:.2f} {}".format(PH[i][0], PH[i][1], PH[i][2]))
if __name__ == "__main__":
n = len(PH)
count = 0
best, best_v = None, -1.0
for c in itertools.combinations(range(n), 7):
count += 1
v = value(list(c))
if v > best_v + 1e-12:
best, best_v = list(c), v
naive = sorted(range(n), key=lambda j: -PH[j][1])[:7]
print("sets searched: {:,}".format(count))
show("exact", best)
g = greedy()
print("greedy value {:.3f}".format(value(g)))
show("naive", naive)
print("exact over naive: {:.3f}".format(best_v / value(naive)))
print("decay exact greedy naive exact/naive")
for d in (0.3, 0.6, 0.9):
ex = max(value(list(c), d)
for c in itertools.combinations(range(n), 7))
gr = value(greedy(7, d), d)
nv = value(naive, d)
print(" {:.1f} {:>6.3f} {:>7.3f} {:>6.3f} {:>11.3f}".format(
d, ex, gr, nv, ex / nv))Single source and citation
Fan, Y. (2026). Niche Keyword Positioning for Digital Monograph Catalogues, High-Ticket Thematic Bundle Direct Sales and Automated Knowledge Cashflow (Version 1.0.0), Chapter 3: Seven Keyword Slots: a Compliance Filter and an Exact Knapsack. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-356 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026356,
author = {Fan, Yafu},
title = {Niche Keyword Positioning for Digital Monograph Catalogues, High-Ticket Thematic Bundle Direct Sales and Automated Knowledge Cashflow},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Power Laws of Search Demand: Rank, Sales and the Share of the Long Tail
- Chapter 2 · Front-Page Probability and the Blue-Ocean Keyword Score
- Chapter 4 · Clustering the Catalogue into Themes and Measuring Bundle Overlap
- Chapter 5 · Bundle Valuation: Correlation, Marginal Cost and Past Purchases
- Chapter 6 · Two Price Tiers: Screening at 99 and 299, the Left Digit, and a Multi-Step Funnel
- Chapter 7 · Classical Sources: the Treatise on Literature of the Hanshu and Naudé's Advice on Establishing a Library
- Chapter 8 · The Empirical Loop: a Weekly Cash Ledger for the Catalogue and the Pricing and Closing Tool Specification