What does Local Pack Ranking and Lead Capture conclude, in numbers, about “Tiers of Urgency: Today, This Week, This Month and the Order of Call-Backs”?
Answer: Same-city enquiries fall into three tiers by the customer's stated deadline: today, this week and this month. The today tier loses 0.02222 of its value per minute, nearly a hundred times the rate of the month tier. Call-backs should go to the most urgent first and, within a tier, to the freshest, but no call may exceed its tier's deadline. The weekly simulation shows that with the owner alone, switching to most urgent first lifts the today tier's retention from 0.4885 to 0.5905, while adding one duty seat lifts it to 0.9636. The rule is free; the seat is the main course.
Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is not legal or marketing-compliance advice; platform policies and laws are governed by their current official texts and change over time.
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.4885, 0.5905, 0.9636
| mean leads per week 90.2 | |||
| setting | policy | kept all | kept today |
| owner alone | fifo | 0.7159 | 0.4885 |
| owner alone | urgency | 0.7644 | 0.5905 |
| owner + duty seat | fifo | 0.9805 | 0.9636 |
| owner + duty seat | urgency | 0.9823 | 0.9674 |
| duty seat only | fifo | 0.9583 | 0.9221 |
| duty seat only | urgency | 0.9637 | 0.9333 |
| two duty seats | fifo | 0.9973 | 0.9949 |
| two duty seats | urgency | 0.9976 | 0.9954 |
Show the full program
# Chapter 6. p62: a simulated week of enquiries, FIFO versus urgency.
# Leads arrive Poisson at 1.5 per open hour over 60 open hours; tier
# mix today 0.5 / week 0.35 / month 0.15 with taus 45 min, 12 h, 72 h.
# Each conversation lasts an exponential 12 min on average. Seats are
# on-duty positions; an owner seat is away (on a viewing or a shoot)
# 2 h out of every 4 h, a duty seat never is. Value kept =
# exp(-wait / tau). Discipline: FIFO, or urgency first (tier, then the
# freshest lead). 200 simulated weeks per setting, common random
# numbers, seed fixed. Rates illustrative.
import bisect
import heapq
import math
import random
TIERS = [("today", 0.50, 45.0), ("week", 0.35, 720.0),
("month", 0.15, 4320.0)]
RATE, HOURS, SERVE = 1.5 / 60.0, 60.0, 12.0
CUM = [math.fsum(w for _, w, _ in TIERS[:k + 1]) for k in range(3)]
def make_week(rng):
t, out = 0.0, []
while True:
t += rng.expovariate(RATE)
if t > HOURS * 60.0:
return out
k = min(2, bisect.bisect_right(CUM, rng.random()))
out.append((t, k, rng.expovariate(1.0 / SERVE)))
def ready(t, away):
# an away seat is out during [240 k + 120, 240 k + 240) minutes
if away and (t % 240.0) >= 120.0:
return t - (t % 240.0) + 240.0
return t
def simulate(leads, seats, policy):
free = [(ready(0.0, a), a) for a in seats]
heapq.heapify(free)
waiting, kept, today = [], [], []
i = 0
while i < len(leads) or waiting:
now, away = heapq.heappop(free)
while i < len(leads) and leads[i][0] <= now:
waiting.append(leads[i])
i += 1
if not waiting:
heapq.heappush(free, (ready(leads[i][0], away), away))
continue
if policy == "fifo":
j = 0
else:
j = min(range(len(waiting)),
key=lambda m: (waiting[m][1], -waiting[m][0]))
arr, k, srv = waiting.pop(j)
v = math.exp(-(now - arr) / TIERS[k][2])
kept.append(v)
if k == 0:
today.append(v)
heapq.heappush(free, (ready(now + srv, away), away))
return math.fsum(kept) / len(kept), math.fsum(today) / len(today)
if __name__ == "__main__":
rng = random.Random(20261120)
weeks = [make_week(rng) for _ in range(200)]
n = math.fsum(len(w) for w in weeks) / 200.0
print("mean leads per week {:.1f}".format(n))
print("setting policy kept all kept today")
settings = [("owner alone", (True,)),
("owner + duty seat", (True, False)),
("duty seat only", (False,)),
("two duty seats", (False, False))]
for name, seats in settings:
for pol in ("fifo", "urgency"):
res = [simulate(w, seats, pol) for w in weeks]
a = math.fsum(r[0] for r in res) / 200.0
b = math.fsum(r[1] for r in res) / 200.0
print("{:<18} {:<8} {:.4f} {:.4f}".format(name, pol, a, b))Single source and citation
Fan, Y. (2026). Local-Pack Search Ranking Factors, Review-Velocity Signalling and High-Urgency Geo-Intent Lead Capture (Version 1.0.0), Chapter 6: Tiers of Urgency: Today, This Week, This Month and the Order of Call-Backs. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-369 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026369,
author = {Fan, Yafu},
title = {Local-Pack Search Ranking Factors, Review-Velocity Signalling and High-Urgency Geo-Intent Lead Capture},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Three Factors Multiplied: the Product Structure of Relevance, Distance and Prominence
- Chapter 2 · Distance Decay: Gravity Curves, the Edge of the Trade Area and a Five-by-Five Rank Grid
- Chapter 3 · Prominence: the Logarithmic Margin of Review Counts, Bayesian Averages and Recent Velocity
- Chapter 4 · Compliant Review Velocity: the Invitation Funnel, Poisson Intervals and "Top Three" as a Simulated Quantile
- Chapter 5 · Capture: Erlang Queues, the Twenty-Second Answer Rate and Answering Seats
- Chapter 7 · Classical Sources: Timing, Place and Harmony, Virtue with Neighbours, and a Good Name over Great Riches
- Chapter 8 · Closing the Loop: the Weekly Same-City Map Ledger, Calculators and Risk-Control Tables