<p>We study the problem of designing multiwinner voting rules that are candidate monotone and proportional. We show that the set of committees satisfying the proportionality axiom of proportionality for solid coalitions is candidate monotone. We further show that Phragmén’s Ordered Rule can be turned into a candidate monotone probabilistic rule which randomizes over committees satisfying proportionality for solid coalitions.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Candidate monotonicity and proportionality for lotteries and non-resolute rules

  • Jannik Peters

摘要

We study the problem of designing multiwinner voting rules that are candidate monotone and proportional. We show that the set of committees satisfying the proportionality axiom of proportionality for solid coalitions is candidate monotone. We further show that Phragmén’s Ordered Rule can be turned into a candidate monotone probabilistic rule which randomizes over committees satisfying proportionality for solid coalitions.