What does Pre-Owned Luxury Authentication and the Lemon Discount conclude, in numbers, about “Agreement Between Appraisers: Cohen's Kappa, the Two Paradoxes of High Agreement and Low Kappa, and the Ceiling on Majority Votes”?

Answer: Chapter 3 discusses the two paradoxes of agreement between appraisers and shows that when one item in five is a copy that fools appraisers together, a panel of nine is right only 0.8757 of the time.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not a pricing opinion on any actual transaction and not personalised legal or investment advice. Marked boxes separate published evidence, runnable Python calculations (20 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.8757

easy-bag accuracy in case B: 0.9500
panel sizecase A independentcase B shared difficulty
10.85000.8500
30.93920.8793
50.97340.8804
70.98790.8782
90.99440.8757
case B with 99 appraisers: 0.8317
Fleiss kappa, 3 appraisers, 300 bags: case A 0.342, case B 0.518
Show the full program
# Chapter 3. p32: a panel of appraisers voting by majority.  Each one
# is right with probability 0.85 on average.  Case A: errors are
# independent (Condorcet).  Case B: a fifth of the bags are hard
# copies that fool most appraisers (each right with 0.45) and the rest
# are easy (right with 0.95), the same average.  Exact binomial sums
# for the majority; Fleiss' kappa from 300 simulated bags (seed
# fixed).  All rates are illustrative.
import math
import random

rng = random.Random(20261112)
HARD, P_HARD = 0.20, 0.45
EASY = (0.85 - HARD * P_HARD) / (1 - HARD)


def majority(p, n):
    return math.fsum(math.comb(n, k) * p ** k * (1 - p) ** (n - k)
                     for k in range(n // 2 + 1, n + 1))


def fleiss(ratings, m):
    n = len(ratings)
    pj = [math.fsum(r[j] for r in ratings) / (n * m) for j in (0, 1)]
    pi = [math.fsum(c * (c - 1) for c in r) / (m * (m - 1))
          for r in ratings]
    pbar, pe = math.fsum(pi) / n, math.fsum(x * x for x in pj)
    return (pbar - pe) / (1 - pe)


def simulate(hard_share, p_hard, p_easy, m=3, n=300, prev=0.20):
    ratings = []
    for _ in range(n):
        fake = rng.random() < prev
        p = p_hard if rng.random() < hard_share else p_easy
        says_fake = 0
        for _ in range(m):
            right = rng.random() < p
            says_fake += int(right == fake)
        ratings.append((says_fake, m - says_fake))
    return fleiss(ratings, m)


print("easy-bag accuracy in case B: {:.4f}".format(EASY))
print("panel size   case A independent   case B shared difficulty")
for n in (1, 3, 5, 7, 9):
    b = HARD * majority(P_HARD, n) + (1 - HARD) * majority(EASY, n)
    print("    {}            {:.4f}               {:.4f}".format(
        n, majority(0.85, n), b))
print("case B with 99 appraisers: {:.4f}".format(
    HARD * majority(P_HARD, 99) + (1 - HARD) * majority(EASY, 99)))
print("Fleiss kappa, 3 appraisers, 300 bags: case A {:.3f}, case B {:.3f}"
      .format(simulate(0.0, 0.85, 0.85), simulate(HARD, P_HARD, EASY)))

Single source and citation

Fan, Y. (2026). Multi-Feature Bayesian Authentication of Pre-Owned Luxury, Akerlof Lemon-Discount Equilibria and the Resale Half-Life of Limited Bags (Version 1.0.0), Chapter 3: Agreement Between Appraisers: Cohen's Kappa, the Two Paradoxes of High Agreement and Low Kappa, and the Ceiling on Majority Votes. 5D Library. DOI pending

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

BibTeX
@book{fan2026171,
  author    = {Fan, Yafu},
  title     = {Multi-Feature Bayesian Authentication of Pre-Owned Luxury, Akerlof Lemon-Discount Equilibria and the Resale Half-Life of Limited Bags},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book