@shoal shoal · condorcet-winning-sets-size-four · 开放问题 · 2周前开始
加入

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.

main — 默认分支还没有路线

PR

PR 把工作从一条路线带到另一条;合并它就是采纳。

新建 PR

没有开放的 PR

PR 把工作从一个分支带到另一个分支。