What does Lead Triage, Viewings and Mandates conclude, in numbers, about “The Information Value of Three Questions: Question Count, Completion and the Stopping Point”?

Answer: The best number of questions is set by two curves. Accuracy rises with the number of questions, but by ever smaller steps; completion falls geometrically. Under the illustrative parameters the value per lead peaks at three questions, at 129.21, and every question after that loses value. Change the keep-rate, though, and the optimum moves anywhere between two and five. The cost of errors sets the threshold, and the threshold sets the tiers. Sequential testing shows that when the first two answers agree the conversation can stop at once, and that when they conflict, supplementary questions cannot move the verdict, so the case should go to a phone conversation instead.

Scope of the numbers: The third needs boundaries: an exclusive mandate serves the owner only up to a commission rate of 0.0287 and a best term of 45 days in the illustrative model. Parameters are illustrative and every number comes from the book's programs.

中文版

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: 129.21

PI 0.20 gain 1,000 false slot 350 nurture 0.30
k completion accuracy value/complete value/lead marginal
01.0000 0.8000 60.00 60.00
10.9600 0.8000 116.00 111.36 +51.36
20.9216 0.8880 135.60 124.97 +13.61
30.8847 0.8679 146.04 129.21 +4.24
40.8493 0.8924 148.51 126.14 -3.07
50.8154 0.8918 150.57 122.77 -3.37
60.7828 0.8951 150.97 118.17 -4.60
70.7514 0.8958 151.25 113.66 -4.52
best number of questions3 (value/lead 129.21)
sensitivity to the keep-rate per extra question:
keep 0.99: best k5 value/lead 138.85
keep 0.98: best k3 value/lead 134.65
keep 0.97: best k3 value/lead 131.92
keep 0.96: best k3 value/lead 129.21
keep 0.94: best k3 value/lead 123.88
keep 0.92: best k2 value/lead 119.76
Show the full program
# Chapter 1. p11: expected net value of a lead form with k questions.
# Model: a fraction PI of submitted leads are buyers who can complete a
# purchase within six months. Each yes/no question has a sensitivity
# (share of real buyers answering "ready") and a specificity (share of
# others answering "not ready"); answers are conditionally independent.
# For each answer pattern the broker either offers a same-day viewing
# slot (gain GAIN from a buyer, loss COST_FP from a non-buyer) or puts
# the lead on a slow nurture track (a buyer is worth NURTURE * GAIN).
# A lead who abandons the form is worth nothing. Every extra question
# keeps only a share DROP of those still filling in the form.
# All parameters are illustrative, not measurements of any real site.
import itertools
import math

PI = 0.20                 # share of genuine buyers among submissions
GAIN = 1000.0             # value units won by a same-day slot to a buyer
COST_FP = 350.0           # value units lost on a slot given to a non-buyer
NURTURE = 0.30            # share of GAIN recovered on the nurture track
C1, DROP = 0.96, 0.96     # completion with one question; keep-rate/extra
QUESTIONS = [             # (label, sensitivity, specificity)
    ("cash", 0.80, 0.80), ("dsr", 0.80, 0.75), ("timeline", 0.78, 0.75),
    ("budget", 0.65, 0.60), ("area", 0.60, 0.58), ("type", 0.58, 0.55),
    ("family", 0.55, 0.53)]


def completion(k, drop):
    return 1.0 if k == 0 else C1 * drop ** (k - 1)


def decision_value(k):
    """Value per completed lead and decision accuracy, exact."""
    vals, acc = [], []
    for ans in itertools.product((1, 0), repeat=k):
        p_b, p_n = PI, 1.0 - PI
        for (lab, se, sp), a in zip(QUESTIONS[:k], ans):
            p_b *= se if a else 1.0 - se
            p_n *= 1.0 - sp if a else sp
        slot = p_b * GAIN - p_n * COST_FP
        slow = p_b * NURTURE * GAIN
        vals.append(max(slot, slow))
        acc.append(p_b if slot > slow else p_n)
    return math.fsum(vals), math.fsum(acc)


def curve(drop):
    return [completion(k, drop) * decision_value(k)[0] for k in range(8)]


if __name__ == "__main__":
    print("PI {:.2f}  gain {:,.0f}  false slot {:,.0f}  nurture {:.2f}"
          .format(PI, GAIN, COST_FP, NURTURE))
    print(" k  completion  accuracy  value/complete  value/lead  marginal")
    vs = curve(DROP)
    for k in range(8):
        v, a = decision_value(k)
        mg = "" if k == 0 else "{:+8.2f}".format(vs[k] - vs[k - 1])
        print("{:2d}  {:10.4f}  {:8.4f}  {:14.2f}  {:10.2f}  {}".format(
            k, completion(k, DROP), a, v, vs[k], mg))
    print("best number of questions: {} (value/lead {:.2f})".format(
        vs.index(max(vs)), max(vs)))
    print("sensitivity to the keep-rate per extra question:")
    for drop in (0.99, 0.98, 0.97, 0.96, 0.94, 0.92):
        c = curve(drop)
        print("  keep {:.2f}: best k = {}   value/lead {:.2f}".format(
            drop, c.index(max(c)), max(c)))

Single source and citation

Fan, Y. (2026). Three-Question Property Lead Qualification, Same-Day Multi-Viewing Closing Kinetics and Exclusive Landlord Mandates (Version 1.0.0), Chapter 1: The Information Value of Three Questions: Question Count, Completion and the Stopping Point. 5D Library. DOI pending

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

BibTeX
@book{fan2026355,
  author    = {Fan, Yafu},
  title     = {Three-Question Property Lead Qualification, Same-Day Multi-Viewing Closing Kinetics and Exclusive Landlord Mandates},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book