What does No Perfect Arbiter conclude, in numbers, about “Conflicting Kit Refusal Codes: an Illustrative Scenario, Deadlock Risk and the Priority Order”?
Answer: The table shows two trends running in opposite directions. More checks make deadlock easier: at a refusal rate of 0.10 with two actions, three checks lock up with probability 0.0734, five checks with 0.1677. More actions make deadlock harder: with the same three checks and rate 0.10, the probability is 0.0734 for two actions and only 0.0054 for four. Yet Chapter 2 has just shown that more actions make majority voting more likely to cycle. Adding candidate actions reduces deadlock while increasing cycles, and the two cannot both be pushed to zero.
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 onlyprinted values that match the answer: 0.0054, 0.0734, 0.10, 0.1677
| p | k | m | P(deadlock) | after relaxing 1 | after relaxing 2 |
| 0.05 | 3 | 2 | 0.0203 | 0.0095 | 0.0025 |
| 0.05 | 3 | 3 | 0.0029 | 0.0009 | 0.0001 |
| 0.05 | 3 | 4 | 0.0004 | 0.0001 | 0.0000 |
| 0.05 | 5 | 2 | 0.0512 | 0.0344 | 0.0203 |
| 0.05 | 5 | 3 | 0.0116 | 0.0064 | 0.0029 |
| 0.05 | 5 | 4 | 0.0026 | 0.0012 | 0.0004 |
| 0.10 | 3 | 2 | 0.0734 | 0.0361 | 0.0100 |
| 0.10 | 3 | 3 | 0.0199 | 0.0069 | 0.0010 |
| 0.10 | 3 | 4 | 0.0054 | 0.0013 | 0.0001 |
| 0.10 | 5 | 2 | 0.1677 | 0.1183 | 0.0734 |
| 0.10 | 5 | 3 | 0.0687 | 0.0407 | 0.0199 |
| 0.10 | 5 | 4 | 0.0281 | 0.0140 | 0.0054 |
| 0.20 | 3 | 2 | 0.2381 | 0.1296 | 0.0400 |
| 0.20 | 3 | 3 | 0.1162 | 0.0467 | 0.0080 |
| 0.20 | 3 | 4 | 0.0567 | 0.0168 | 0.0016 |
| 0.20 | 5 | 2 | 0.4520 | 0.3486 | 0.2381 |
| 0.20 | 5 | 3 | 0.3039 | 0.2058 | 0.1162 |
| 0.20 | 5 | 4 | 0.2043 | 0.1215 | 0.0567 |
| more guards raise the deadlock risk; more options lower it |
Show the full program
# Chapter 6. p62: when every option draws at least one refusal.
# k guards each refuse each of m options independently with probability
# p (illustrative; real refusal rates must be read from the kit logs).
# Under "any refusal blocks", no option is left when every option is
# refused by someone: P(deadlock) = (1 - (1 - p) ** k) ** m.
# A written priority lets the arbiter relax the lowest-ranked guard
# first; after relaxing one guard the deadlock risk becomes the same
# formula with k - 1. Exact Fraction arithmetic, printed as decimals.
from fractions import Fraction
def dead(p, k, m):
return (1 - (1 - p) ** k) ** m
if __name__ == "__main__":
print(" p k m P(deadlock) after relaxing 1 after relaxing 2")
for p in (Fraction(1, 20), Fraction(1, 10), Fraction(1, 5)):
for k in (3, 5):
for m in (2, 3, 4):
print("{:.2f} {:>2} {:>2} {:.4f} {:.4f}"
" {:.4f}".format(
float(p), k, m, float(dead(p, k, m)),
float(dead(p, k - 1, m)),
float(dead(p, k - 2, m))))
print("more guards raise the deadlock risk; more options lower it")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 6: Conflicting Kit Refusal Codes: an Illustrative Scenario, Deadlock Risk and the Priority Order. 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
- Chapter 1 · Four Axioms and an Empty Table: Arrow's Theorem Enumerated for Three Reviewers and Three Options
- Chapter 2 · The Exact Probability of a Condorcet Cycle: 216 Profiles, Panel Size and the Number of Options
- Chapter 3 · The Borda Count and Irrelevant Options: Twenty-One Electors, Decoys and Spoilers
- Chapter 4 · Single-Peaked Preferences and Value Restriction: When Cycles Disappear
- Chapter 5 · The Lexicographic Priority Arbiter: Which Axiom It Gives Up and What It Buys
- Chapter 7 · Eastern and Western Sources Examined: First Grader, Review Grader and Arbiter in the Song History, and Borda's Equal Steps
- Chapter 8 · Closing the Loop: Turning Multi-Reviewer Verdicts in the Kits into an Explicit Priority, with a Pre-Registered Plan of Refutation