What does Sprint to Cruise and the Three-Hour Cap conclude, in numbers, about “Bounding Decision Fatigue and Filling the Three Hours: Heap-Based Top-k Selection”?

Answer: Chapter 4 bounds the evidence on decision fatigue and selects window items with a heap by value per minute, covering 0.682 of value under a heavy tail against 0.220 for first come, first served.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; energy and sleep are personal tracking trends only; the book is not medical advice and not personalised business or investment advice. Chapter 1 uses a concave hours-output curve and a parameter grid to show that the best daily duration falls in a narrow band, with 0.734 of the illustrative grid between two and four hours.

中文版

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.220, 0.682

A. share of daily value covered in 180 minutes
alphaFCFStop valuevalue/minuteitems done
1.10.2200.6650.68211.3
1.50.2160.5290.56012.2
2.00.2200.4390.48412.9
3.00.2160.3490.41913.7
B. FCFS covers about its time share: 180 / 900 = 0.200
Show the full program
# Chapter 4. p42: which items earn a place in the three hours.
# Each synthetic day has 40 pending items. Value follows a Pareto law
# with tail index alpha (smaller alpha = heavier tail); the time each
# item needs is uniform on 5 to 40 minutes. The budget is 180 minutes.
# Rules compared: first come first served; largest value first via a
# heap (heapq.nlargest) while time remains; largest value per minute
# first. Reported: mean share of the day's total value covered. 2000
# seeded days per alpha.
import heapq
import math
import random
import statistics

N = 40
BUDGET = 180.0
DAYSN = 2000


def day(rng, alpha):
    return [(rng.paretovariate(alpha), rng.uniform(5.0, 40.0))
            for _ in range(N)]


def fill(items):
    used, got = 0.0, []
    for v, t in items:
        if used + t <= BUDGET:
            used += t
            got.append(v)
    return math.fsum(got)


if __name__ == "__main__":
    rng = random.Random(40442)
    print("A. share of daily value covered in 180 minutes")
    print("   alpha   FCFS    top value   value/minute  items done")
    for alpha in (1.1, 1.5, 2.0, 3.0):
        f, h, d, k = [], [], [], []
        for _ in range(DAYSN):
            items = day(rng, alpha)
            tot = math.fsum(v for v, _ in items)
            f.append(fill(items) / tot)
            h.append(fill(heapq.nlargest(N, items)) / tot)
            dens = sorted(items, key=lambda x: x[0] / x[1], reverse=True)
            d.append(fill(dens) / tot)
            cnt, used = 0, 0.0
            for v, t in dens:
                if used + t <= BUDGET:
                    used += t
                    cnt += 1
            k.append(cnt)
        print("   {:.1f}    {:.3f}   {:.3f}       {:.3f}         {:.1f}"
              .format(alpha, statistics.mean(f), statistics.mean(h),
                      statistics.mean(d), statistics.mean(k)))
    print("B. FCFS covers about its time share: 180 / {:.0f} = {:.3f}"
          .format(N * 22.5, BUDGET / (N * 22.5)))

Single source and citation

Fan, Y. (2026). Transitioning from Sprint to Sovereign Cruise: The Three-Hour Daily Decision Cap and Sustainable Creator Vitality (Version 1.0.0), Chapter 4: Bounding Decision Fatigue and Filling the Three Hours: Heap-Based Top-k Selection. 5D Library. DOI pending

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

BibTeX
@book{fan2026404,
  author    = {Fan, Yafu},
  title     = {Transitioning from Sprint to Sovereign Cruise: The Three-Hour Daily Decision Cap and Sustainable Creator Vitality},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book