Approval with Runoff
Th\'eo Delemazure, J\'er\^ome Lang, Jean-Fran\c{c}ois Laslier, Remzi, M. Sanver

TL;DR
This paper introduces runoff voting rules based on approval ballots, analyzes their properties through axiomatic methods, and evaluates their performance on single-peaked and real-world data.
Contribution
It proposes a family of runoff rules derived from approval-based committee rules and studies their axiomatic properties and practical outcomes.
Findings
Runoff rules can be effectively derived from approval-based committee rules.
Axiomatic analysis reveals desirable properties of the proposed runoff rules.
Empirical evaluation shows the rules perform well on real and single-peaked data.
Abstract
We define a family of runoff rules that work as follows: voters cast approval ballots over candidates; two finalists are selected; and the winner is decided by majority. With approval-type ballots, there are various ways to select the finalists. We leverage known approval-based committee rules and study the obtained runoff rules from an axiomatic point of view. Then we analyze the outcome of these rules on single-peaked profiles, and on real data.
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.
