What does No Perfect Arbiter conclude, in numbers, about “Closing the Loop: Turning Multi-Reviewer Verdicts in the Kits into an Explicit Priority, with a Pre-Registered Plan of Refutation”?

Answer: Chapter 8 gives a seven-step verdict procedure, the distilled Reviewer Aggregation Paradox Detector and a pre-registered plan of refutation. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.

Scope of the numbers: Reviewer names and parameters are illustrative, all calculations are generated by the book's programs, and the book is general business analysis, not business advice. Chapter 6 builds a scenario of conflicting kit refusal codes with illustrative rule names, computes deadlock risks and recommends a hybrid rule that vetoes first and then compares grades in written priority order.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python only

decisions audited60
CYCLE8
SPOILER13
OVERRIDE23
SPLIT4
no flag34
first flagged decisions:
#2 BCA ABC CAB CYCLE,SPOILER,OVERRIDE
#4 BCA ABC CAB CYCLE,SPOILER,OVERRIDE
#5 ACDB DACB BCDA CYCLE,SPOILER,OVERRIDE
#6 ABC BAC BCA OVERRIDE
Show the full program
# Chapter 8. p81: a quarterly audit of a multi-guard decision log.
# The log is synthetic (fixed seed): 60 decisions, each with 3 guards
# ranking 3 or 4 options uniformly at random, i.e. the worst case of
# chapter 2. For each decision the detector raises four flags:
#   CYCLE     no Condorcet winner
#   SPOILER   deleting a non-winning option changes the Borda winner
#   OVERRIDE  a majority prefers some option to the priority pick
#   SPLIT     Borda winner and Condorcet winner differ
# A real audit replaces the synthetic log with the kit's own records.
import itertools
import random

rng = random.Random(20261113)


def beats(prof, x, y):
    return 2 * len([o for o in prof if o.index(x) < o.index(y)]) > len(prof)


def condorcet(prof):
    opts = sorted(prof[0])
    for x in opts:
        if all(beats(prof, x, y) for y in opts if y != x):
            return x
    return None


def borda(prof):
    m = len(prof[0])
    s = {}
    for o in prof:
        for pos, c in enumerate(o):
            s[c] = s.get(c, 0) + m - 1 - pos
    return min(s, key=lambda c: (-s[c], c))


def flags(prof):
    out = []
    cw = condorcet(prof)
    bw = borda(prof)
    if cw is None:
        out.append("CYCLE")
    for d in prof[0]:
        if d == bw:
            continue
        sub = [tuple(c for c in o if c != d) for o in prof]
        if borda(sub) != bw:
            out.append("SPOILER")
            break
    lex = prof[0][0]
    if any(beats(prof, y, lex) for y in prof[0] if y != lex):
        out.append("OVERRIDE")
    if cw is not None and cw != bw:
        out.append("SPLIT")
    return out


if __name__ == "__main__":
    log = []
    for k in range(60):
        opts = "ABC" if k % 2 == 0 else "ABCD"
        orders = list(itertools.permutations(opts))
        log.append([rng.choice(orders) for _ in range(3)])
    count = {f: 0 for f in ("CYCLE", "SPOILER", "OVERRIDE", "SPLIT")}
    clean = 0
    for prof in log:
        fl = flags(prof)
        for f in fl:
            count[f] += 1
        if not fl:
            clean += 1
    print("decisions audited: {}".format(len(log)))
    for f in count:
        print("  {:<8} {:>3}".format(f, count[f]))
    print("  no flag  {:>3}".format(clean))
    print("first flagged decisions:")
    shown = 0
    for i, prof in enumerate(log):
        fl = flags(prof)
        if fl and shown < 4:
            shown += 1
            print("  #{:<2} {}  {}".format(
                i, " ".join("".join(o) for o in prof), ",".join(fl)))

Single source and citation

Fan, Y. (2026). Arrow's Impossibility Theorem and the Aggregation of Multiple Reviewers: Why No Perfect Arbiter Exists When Kit Refusal Codes Conflict (Version 1.0.0), Chapter 8: Closing the Loop: Turning Multi-Reviewer Verdicts in the Kits into an Explicit Priority, with a Pre-Registered Plan of Refutation. 5D Library. DOI pending

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

BibTeX
@book{fan2026310,
  author    = {Fan, Yafu},
  title     = {Arrow's Impossibility Theorem and the Aggregation of Multiple Reviewers: Why No Perfect Arbiter Exists When Kit Refusal Codes Conflict},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book