Axiomatizations of a simple Condorcet voting method for Final Four and Final Five elections
Wesley H. Holliday

TL;DR
This paper axiomatizes a simple Condorcet voting method for Final Four elections, extends it to Final Five elections, and provides normative principles and characterizations for these methods.
Contribution
It introduces a new axiomatic characterization of a simple Condorcet method for Final Four elections and proposes a straightforward extension to Final Five elections.
Findings
Unique axiomatic characterization of the Final Four method
A simpler extension to Final Five elections based on head-to-head wins and losses
Clarification of principles supporting Condorcet-based voting in small elections
Abstract
Proponents of Condorcet voting face the question of what to do in the rare case when no Condorcet winner exists. Recent work provides compelling arguments for the rule that should be applied in three-candidate elections, but already with four candidates, many rules appear reasonable. In this paper, we consider a recent proposal of a simple Condorcet voting method for Final Four political elections. Our question is what normative principles could support this simple form of Condorcet voting. When there is no Condorcet winner, one natural principle is to pick the candidate who is closest to being a Condorcet winner. Yet there are multiple plausible ways to define closeness, leading to different results. Here we take the following approach: identify a relatively uncontroversial sufficient condition for one candidate to be closer than another to being a Condorcet winner; then use other…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
