What does Ego Depletion and the Hungry Judges conclude, in numbers, about “A Decision-Fatigue Schedule: The Rearrangement Inequality and a Dynamic Programme for Breaks”?

Answer: Chapter 6 uses the rearrangement inequality and dynamic programming to derive rules for ordering and breaks: in a small-effect world, big matters first saves only 0.0100 of total stakes.

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.0100

orders enumerated: 40320, total stakes 130
deltadescendingrandom meanascendingbest=descsaving
0.00013.00013.00013.000yes0.000
0.00213.39013.91014.430yes0.520
0.00513.97515.27516.575yes1.300
0.02016.90022.10027.300yes5.200
at delta 0.005 the rule saves 0.0100 of total stakes
Show the full program
# Chapter 6. p61: Highest stakes first - exact check over all orders.
# Eight decisions with stakes 50, 30, 20, 12, 8, 5, 3, 2 (units of money,
# illustrative). The chance of a costly error at position t is
# e0 + delta * (t - 1), e0 = 0.10. Expected loss = sum of stake * error
# chance. All 40320 orders are enumerated for each delta; by the
# rearrangement inequality descending stakes should be best. Delta 0.005
# sits near the pooled replication; 0.02 is a strong-depletion world.
# 高风险先决:枚举全部排列,验证重排不等式。
import math
from itertools import permutations

STAKES = (50, 30, 20, 12, 8, 5, 3, 2)
E0 = 0.10


def loss(order, delta):
    return math.fsum(s * (E0 + delta * t) for t, s in enumerate(order))


total = math.fsum(STAKES)
print("orders enumerated: {}, total stakes {:.0f}".format(
    math.factorial(len(STAKES)), total))
print("delta   descending  random mean  ascending  best=desc  saving")
for delta in (0.0, 0.002, 0.005, 0.02):
    vals = [loss(p, delta) for p in permutations(STAKES)]
    desc = loss(sorted(STAKES, reverse=True), delta)
    asc = loss(sorted(STAKES), delta)
    mean = math.fsum(vals) / len(vals)
    best = min(vals)
    print("{:.3f}   {:9.3f}   {:10.3f}  {:9.3f}   {:8s}  {:6.3f}".format(
        delta, desc, mean, asc, "yes" if abs(best - desc) < 1e-9
        else "no", mean - desc))
d = 0.005
gain = (math.fsum(loss(p, d) for p in permutations(STAKES)) /
        math.factorial(len(STAKES)) - loss(sorted(STAKES)[::-1], d))
print("at delta {:.3f} the rule saves {:.4f} of total stakes".format(
    d, gain / total))

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 6: A Decision-Fatigue Schedule: The Rearrangement Inequality and a Dynamic Programme for Breaks. 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