Approximability of Manipulating Elections

In this paper, we set up a framework to study approximation of manipulation, control, and bribery in elections. We show existence of approximation algorithms (even fully polynomial time approximation schemes) as well as obtain inapproximability results.

Authors

• Eric Brelsford Piotr Faliszewski
• Edith Hemaspaandra

Keywords

No keywords are indexed for this paper.