Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control

Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control
复制标题

混合选举扩大了控制的复杂性理论阻力

DOI:
10.1002/malq.200810019
复制
发表时间:
2006
影响因子:
0.3
通讯作者:
J. Rothe
J. Rothe
中科院分区:
数学4区
文献类型:
--
作者:
E. Hemaspaandra;L. Hemaspaandra;J. Rothe

文献摘要

被引文献

相似文献

选举控制是指选举组织者(“主席”)试图通过增加/删除/划分选民或候选人来影响结果。Bartholdi、Tovey和Trick [1]的重要论文引入了(构造性)控制,提出了计算复杂性作为抵抗控制尝试的一种手段:寻找这样的选举系统,其中主席寻求控制的任务本身在计算上是不可行的。
Electoral control refers to attempts by an election's organizer (“the chair”) to influence the outcome by adding/deleting/partitioning voters or candidates. The important paper of Bartholdi, Tovey, and Trick [1] that introduces (constructive) control proposes computational complexity as a means of resisting control attempts: Look for election systems where the chair's task in seeking control is itself computationally infeasible.