共 50 条
Vote trading and subset sums
被引:2
|作者:
Bervoets, Sebastian
[1
]
Merlin, Vincent
[1
,2
]
Woeginger, Gerhard J.
[3
]
机构:
[1] CNRS, Marseille, France
[2] Univ Caen, F-14032 Caen, France
[3] TU Eindhoven, Dept Math, Eindhoven, Netherlands
关键词:
Vote swapping;
Vote trading;
Manipulation;
Subset sum problem;
D O I:
10.1016/j.orl.2014.12.007
中图分类号:
C93 [管理学];
O22 [运筹学];
学科分类号:
070105 ;
12 ;
1201 ;
1202 ;
120202 ;
摘要:
We analyze the complexity of vote trading problems with equal-sized voting districts. For two allied votes-wapping parties, the problem is polynomially solvable. For three parties, the problem is NP-complete. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:99 / 102
页数:4
相关论文