What does Ego Depletion and the Hungry Judges conclude, in numbers, about “Closing the Loop: An Owner's Decision Log and a Preregistered Plan for Falsification”?

Answer: Chapter 8 gives an owner's decision-log procedure, the distilled tool Decision Sequencer and a preregistered plan: logging alone for 120 working days detects gaps no smaller than 0.072. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; the book is not psychological or medical advice, and its procedures and tool are non-personalised business guidance. Marked boxes separate published evidence, runnable Python calculations (18 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: 0.072, 120

testgap/marginn per armdecisionsworkdays
superiority0.032,9435,886736
superiority0.051,0942,188274
superiority0.1029458874
equivalence0.051,0972,194275
equivalence0.1027555069
120 workdays -> 480 per arm; detectable gap at 80% power 0.072
Show the full program
# Chapter 8. p81: How many logged decisions does a fair test need?
# Outcome: a decision judged sound at the 90-day review (yes/no).
# Superiority: early-slot rate 0.80 against a late-slot rate lower by
# 0.03, 0.05 or 0.10; two-sided alpha 0.05, power 0.80. Equivalence
# (TOST, alpha 0.05 each side, power 0.80 when the true gap is zero)
# with margins 0.05 and 0.10. Eight high-stakes decisions a day, four
# early and four late, randomised within the day. Planning values only.
# 预注册检验的样本量:一位老板要记多少条决策。
import math
from statistics import NormalDist

Z = NormalDist()
P0, PER_DAY_ARM = 0.80, 4
za2, za, zb, zb2 = (Z.inv_cdf(0.975), Z.inv_cdf(0.95),
                    Z.inv_cdf(0.80), Z.inv_cdf(0.90))


def n_super(p1, p2):
    pbar = (p1 + p2) / 2
    num = (za2 * math.sqrt(2 * pbar * (1 - pbar)) +
           zb * math.sqrt(p1 * (1 - p1) + p2 * (1 - p2))) ** 2
    return math.ceil(num / (p1 - p2) ** 2)


def n_equiv(p, margin):
    return math.ceil(2 * p * (1 - p) * (za + zb2) ** 2 / margin ** 2)


print("test           gap/margin  n per arm  decisions  workdays")
for gap in (0.03, 0.05, 0.10):
    n = n_super(P0, P0 - gap)
    print("superiority      {:.2f}       {:6,d}    {:7,d}   {:6d}".format(
        gap, n, 2 * n, math.ceil(n / PER_DAY_ARM)))
for m in (0.05, 0.10):
    n = n_equiv(P0, m)
    print("equivalence      {:.2f}       {:6,d}    {:7,d}   {:6d}".format(
        m, n, 2 * n, math.ceil(n / PER_DAY_ARM)))
days = 120
n = days * PER_DAY_ARM
se = math.sqrt(2 * P0 * (1 - P0) / n)
print("{} workdays -> {} per arm; detectable gap at 80% power {:.3f}"
      .format(days, n, (za2 + zb) * se))

Single source and citation

Fan, Y. (2026). The Failed Replication of Ego Depletion, the Ordering Artefact behind the Hungry Judges and Decision-Fatigue Scheduling (Version 1.0.0), Chapter 8: Closing the Loop: An Owner's Decision Log and a Preregistered Plan for Falsification. 5D Library. DOI pending

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

BibTeX
@book{fan2026196,
  author    = {Fan, Yafu},
  title     = {The Failed Replication of Ego Depletion, the Ordering Artefact behind the Hungry Judges and Decision-Fatigue Scheduling},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book