AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Stable Voting and the Splitting of Cycles

Wesley H. Holliday, Milan Mossé, Chase Norman, Eric Pacuit, Cynthia Wang

AAAI 2026 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
allow 7 alternatives instead of at most 6Simple Stable Voting vs Split Cycle conjecture · linear ordinal margin matricesSSV winner is a Split Cycle winner: proof of unsatisfiability in 0.5 seconds -> counterexample in 73 secondsHurt
require a single Split Cycle winner in the SAT encoding (n=7)SAT counterexample search · 7 alternativescounterexample existence: unsatisfiable in 6 hours and 45 minutesHurt
increase alternatives to 8 with a single Split Cycle winnerSAT counterexample search · 8 alternativescounterexample existence: counterexample found in 24 minutesImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy