关于「同天连看:时间窗路线、锚定权重与一天看几套」,《资质三问、同天连看与独家委托》给出的定量结论是什么?

结论:五套房的 120 种顺序里只有 8 种能走通,最优顺序比最差的可行顺序早五十分钟结束;刻意的布局顺序多花一刻钟。诺斯克拉夫特与尼尔的数字隐含锚定权重 0.4850,专家也不例外。同天连看时,前一套的叫价构成第二个锚,事前比较表能把它的影响压到原来的三分之一左右。看几套由比较价值的边际递减与时间成本共同决定,示意参数下三套最优,但时间成本一变,最优就在两套到八套之间移动。

数据口径:第一句被证伪:每多问一题,完成率下降,准确率的边际增益递减;示意参数下,现金、偿债比与时间表三问使每条线索的期望净价值达到峰值 129.21,但最优题数随每题留存比例在二到五题之间移动,三问是区间结论而不是定律。 第二句只对了一半:锚定在房价判断中真实存在,诺斯克拉夫特与尼尔的数字隐含锚定权重 0.4850;诱饵效应在真实可感的选择里通常不出现,示意账本中诱饵要胜过真比较房,效应须超过 0.1200。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 120

feasible orders8 of 120
rank order finish drive wait
1 ABCED14:45 135 0
2 ABEDC15:00 150 0
3 CABED15:00 150 0
4 ABECD15:05 155 0
5 ACBED15:10 160 0
worst feasible: BAECD15:35 160 25
staged order CABED15:00 drive 150 wait 0
orders to check for 5, 6, 7, 8 units120, 720, 5,040, 40,320
查看完整验算程序
# Chapter 4. p41: same-day viewing order by exhaustive search.
# Start at the buyer's meeting point O at 10:00; five listings A-E, each
# with an owner or tenant window (earliest, latest start, in minutes
# after midnight) and a 30-minute viewing. Drive times in minutes are
# illustrative Klang Valley magnitudes, not a traffic model. Arriving
# early means waiting; arriving after the latest start is infeasible.
# All 5! = 120 orders are checked; the best feasible order minimises
# finishing time, then driving.
import itertools
import math

NAMES = "OABCDE"
T = [[0, 25, 35, 20, 40, 30],
     [25, 0, 20, 30, 35, 45],
     [35, 20, 0, 25, 30, 50],
     [20, 30, 25, 0, 25, 35],
     [40, 35, 30, 25, 0, 30],
     [30, 45, 50, 35, 30, 0]]
WIN = {1: (600, 720), 2: (660, 780), 3: (600, 900), 4: (780, 960),
       5: (720, 840)}
VIEW = 30
START = 600


def hhmm(m):
    return "{:02d}:{:02d}".format(m // 60, m % 60)


def simulate(order):
    t, here, drive, wait = START, 0, 0, 0
    for j in order:
        t += T[here][j]
        drive += T[here][j]
        lo, hi = WIN[j]
        if t < lo:
            wait += lo - t
            t = lo
        if t > hi:
            return None
        t += VIEW
        here = j
    return t, drive, wait


if __name__ == "__main__":
    rows = []
    for order in itertools.permutations(range(1, 6)):
        r = simulate(order)
        if r:
            rows.append((r[0], r[1], r[2], order))
    rows.sort()
    print("feasible orders: {} of 120".format(len(rows)))
    print("rank  order   finish  drive  wait")
    for i, (fin, dr, wt, order) in enumerate(rows[:5]):
        print("{:4d}  {}  {}  {:5d}  {:4d}".format(
            i + 1, "".join(NAMES[j] for j in order), hhmm(fin), dr, wt))
    fin, dr, wt, order = rows[-1]
    print("worst feasible: {}  {}  {:5d}  {:4d}".format(
        "".join(NAMES[j] for j in order), hhmm(fin), dr, wt))
    staged = (3, 1, 2, 5, 4)      # C first as a weak "warm-up" unit
    r = simulate(staged)
    print("staged order CABED: {}".format(
        "infeasible" if r is None else "{} drive {} wait {}".format(
            hhmm(r[0]), r[1], r[2])))
    print("orders to check for 5, 6, 7, 8 units: " + ", ".join(
        "{:,}".format(math.factorial(n)) for n in (5, 6, 7, 8)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《房产高意向客资质三问秒筛、多盘同天连看逼单与房东独家委托母典》第 4 章「同天连看:时间窗路线、锚定权重与一天看几套」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论