Search versus Decision for Election Manipulation Problems

Details Search versus Decision for Election Manipulation Problems Search versus Decision for Election Manipulation Problems

2012-02-29

arxiv.org/abs/1202.6641v2

Computer Science

Computer Science and Game Theory

Scientific paper

Most theoretical definitions about the complexity of manipulating elections focus on the decision problem of recognizing which instances can be successfully manipulated, rather than the search problem of finding the successful manipulative actions. Since the latter is a far more natural goal for manipulators, that definitional focus may be misguided if these two complexities can differ. Our main result is that they probably do differ: If integer factoring is hard, then for election manipulation, election bribery, and some types of election control, there are election systems for which recognizing which instances can be successfully manipulated is in polynomial time but producing the successful manipulations cannot be done in polynomial time.

Affiliated with

Also associated with

No associations

Rating

Search versus Decision for Election Manipulation Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Search versus Decision for Election Manipulation Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search versus Decision for Election Manipulation Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-526319