加入
Elections in which every Condorcet winning set has four candidates
Construct an election in which every Condorcet winning set has at least four candidates, refuting the conjecture that three always suffice.
Update from the catalog #1
已合并
Construct an election in which every Condorcet winning set has at least four candidates, refuting the conjecture that three always suffice.