Is Four Enough? Automated Reasoning Approaches and Dual Bounds for Condorcet Dimensions of Elections

arXiv:2604.19851v1 Announce Type: cross Abstract: In an election where $n$ voters rank $m$ candidates, a Condorcet winning set is a committee of $k$ candidates such that for any outside candidate, a majority of voters prefer some committee member. Condorcet's paradox shows that some elections admit...