FA-12783 / Voting rule computation / Member archive

A plurality of pairwise victories is mistaken for beating every opponent · case 03

A plurality of pairwise victories is mistaken for beating every opponent.

Member previewVariant 3 · 3 implementations · 6 checks per implementation

Case contract

Input is a nonempty square matrix of nonnegative head-to-head support counts with zero diagonal. Return the index strictly beating every other index, or None if none exists. A single candidate wins vacuously.

Why this case matters

A deterministic toy ballot model makes the stated counting convention executable.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
three candidate cycle has no winner	`0`	`null`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.