首页> 外文期刊>ACM transactions on economics and computation >Aggregation of Votes with Multiple Positions on Each Issue
【24h】

Aggregation of Votes with Multiple Positions on Each Issue

机译:在每个问题上都有多个职位的投票汇总

获取原文
获取原文并翻译 | 示例
           

摘要

We consider the problem of aggregating votes cast by a society on a fixed set of issues, where each member of the society may vote for one of several positions on each issue, but the combination of votes on the various issues is restricted to a set of feasible voting patterns. We follow the aggregation framework used by Dokow and Holzman [Aggregation of non-binary evaluations, Advances in Applied Mathematics, 45:4, 487-504, 2010], in which both preference aggregation and judgment aggregation can be cast. We require the aggregation to be independent on each issue, and also supportive, i.e., for every issue, the corresponding component of every aggregator, when applied to a tuple of votes, must take as value one of the votes in that tuple.We prove that, in such a setup, non-dictatorial aggregation of votes in a society of an arbitrary size is possible if and only if either there is a non-dictatorial aggregator for two voters or there is an aggregator for three voters such that, for each issue, the corresponding component of the aggregator, when restricted to two-element sets of votes, is a majority operation or a minority operation. We then introduce a notion of a uniform non-dictatorial aggregator, which is an aggregator such that on every issue, and when restricted to arbitrary two-element subsets of the votes for that issue, it differs from all projection functions. We first give a characterization of sets of feasible voting patterns that admit a uniform non-dictatorial aggregator. After this and by making use of Bulatov's dichotomy theorem for conservative constraint satisfaction problems, we connect social choice theory with the computational complexity of constraint satisfaction by proving that if a set of feasible voting patterns has a uniform non-dictatorial aggregator of some arity, then themulti-sorted conservative constraint satisfaction problem on that set (with each issue representing a different sort) is solvable in polynomial time; otherwise, it is NP-c
机译:我们考虑了一个社会对固定问题进行汇总的投票的问题,社会的每个成员都可以在每个问题上投票赞成几个职位之一,但是关于各种问题的选票的组合仅限于一组可行的投票模式。我们遵循Dokow和Holzman使用的聚合框架[非二进制评估的聚合,应用数学的进步,45:4,487-504,2010],在其中,可以施放偏好聚合和判断聚合。我们要求汇总在每个问题上都是独立的,也需要支持性,即,对于每个问题,当将每个聚合器的相应组件应用于元组时,都必须将其视为该元组中的价值之一。我们证明在这种设置中,只有当两名选民有一个非典型的聚合者,或者只有三个选民的聚合,每个选民都可以在一个任意规模的社会中对投票的非划分汇总,这是可能的。问题是,当聚合器的相应组成部分仅限于两元素的选票集时,是多数股权或少数族裔操作。然后,我们引入了一个统一的非隔离聚合器的概念,该概念是一个聚合器,因此在每个问题上,并且仅限于该问题的投票的任意两元素子集时,它与所有投影函数不同。我们首先给出一组可行的投票模式集,这些模式接纳了一个统一的非描述汇总器。此后,通过利用Bulatov的二分法定理来解决保守的约束满意度问题,我们通过证明一组可行的投票模式将社会选择理论与约束满意度的计算复杂性联系起来,如果一组可行的投票模式具有统一的非局部性聚合器,那么那么在多项式时间内,可以解决该集合中的它们分类的保守约束满意度问题(每个问题代表不同的问题)。否则,是NP-C

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号