对称简约型投票
Symmetric reduced form voting
AI总结:
研究对称环境下两备选方案的投票模型,刻画了对称投票规则可实施的期中分配概率,证明其可表示为合格多数与合格反多数规则的凸组合,并推广至单调与一致规则。
摘要:
我们在对称环境中研究一个包含两个备选方案的投票模型。我们刻画了可由对称投票规则实施的期中分配概率。我们证明,每个此类期中分配概率均可实施为两族确定性投票规则的凸组合:合格多数与合格反多数。我们还通过要求由对称单调(防策略)投票规则和对称一致投票规则实施,提供了类似的结果。我们应用结果证明,事前 Rawlsian 规则是合格多数规则对的凸组合。
英文摘要:
We study a model of voting with two alternatives in a symmetric environment. We characterize the interim allocation probabilities that can be implemented by a symmetric voting rule. We show that every such interim allocation probabilities can be implemented as a convex combination of two families of deterministic voting rules: qualified majority and qualified anti-majority. We also provide analogous results by requiring implementation by a symmetric monotone (strategy-proof) voting rule and by a symmetric unanimous voting rule. We apply our results to show that an ex-ante Rawlsian rule is a convex combination of a pair of qualified majority rules.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。