Where are the hard manipulation problems?

Details Where are the hard manipulation problems? Where are the hard manipulation problems?

2010-07-29

arxiv.org/abs/1007.5114v1

Computer Science

Artificial Intelligence

Invited tutorial at the Third International Workshop on Computational Social Choice 2010

Scientific paper

One possible escape from the Gibbard-Satterthwaite theorem is computational
complexity. For example, it is NP-hard to compute if the STV rule can be
manipulated. However, there is increasing concern that such results may not re
ect the difficulty of manipulation in practice. In this tutorial, I survey
recent results in this area.

Affiliated with

Also associated with

No associations

Rating

Where are the hard 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 Where are the hard manipulation problems?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Where are the hard manipulation problems? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-450623