Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm.
Lin ChenLei XuShouhuai XuZhimin GaoWeidong ShiPublished in: CoRR (2018)
Keyphrases
- np hard
- computational complexity
- dynamic programming
- experimental evaluation
- learning algorithm
- worst case
- times faster
- monte carlo
- detection algorithm
- approximation ratio
- improved algorithm
- greedy algorithm
- computational cost
- cost function
- closed form
- error bounds
- convex hull
- k means
- significant improvement
- optimization algorithm
- input data
- theoretical analysis
- probabilistic model
- particle swarm optimization
- linear programming
- preprocessing
- recognition algorithm
- objective function
- voting scheme
- genetic algorithm