An Exposition of Five Candidates Suffice for a Majority

2026-06-12

AI Summary

This study addresses a fundamental problem in ranked-preference elections: constructing a small candidate set that robustly represents majority preferences. By integrating combinatorial arguments with Condorcet criterion analysis, the authors rigorously establish—for the first time—that every such election admits a Condorcet winning set containing at most five candidates. This set is guaranteed to defeat any external candidate in pairwise majority comparisons. The result establishes five as a universal, tight upper bound on the size of Condorcet winning sets, significantly advancing the theoretical foundations of social choice and enhancing the practical applicability of majority-based decision mechanisms.

Abstract

We give a brief exposition of a result of Song, Nguyen, and Lin (2026) that every election (with ranked preferences) has a Condorcet winning set of at most five candidates.

Problem

• Condorcet winning set
• ranked preferences
• election
• majority
• candidates

Innovation

• Condorcet winning set
• ranked preferences
• social choice theory
• majority rule
• election theory