Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard.
Nadja BetzlerRolf NiedermeierGerhard J. WoegingerPublished in: IJCAI (2011)
Keyphrases
- voting rules
- np hard
- scoring rules
- computationally hard
- np hardness
- computational social choice
- computational complexity
- special case
- partial order
- lower bound
- np complete
- scheduling problem
- single peaked
- integer programming
- approximation algorithms
- decision problems
- linear programming
- social choice
- minimum cost
- worst case
- optimal solution
- branch and bound algorithm
- knapsack problem
- closely related
- cooperative
- greedy heuristic
- set cover
- approximation ratio
- learning algorithm
- constraint satisfaction problems
- remains np hard