Sciweavers

Share
CORR
2011
Springer

Dominating Manipulations in Voting with Partial Information

9 years 3 months ago
Dominating Manipulations in Voting with Partial Information
We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information set, which is the set of profiles of the nonmanipulators that are indistinguishable to the manipulator. Given such an information set, a dominating manipulation is a non-truthful vote that the manipulator can cast which makes the winner at least as preferable (and sometimes more preferable) as the winner when the manipulator votes truthfully. When the manipulator has full information, computing whether or not there exists a dominating manipulation is in P for many common voting rules (by known results). We show that when the manipulator has no information, there is no dominating manipulation for many common voting rules. When the manipulator’s information is represented by partial orders and only a small portion of the preferences are unknown, computing a dominating manipulation is NP-hard for many common...
Vincent Conitzer, Toby Walsh, Lirong Xia
Added 19 Aug 2011
Updated 19 Aug 2011
Type Journal
Year 2011
Where CORR
Authors Vincent Conitzer, Toby Walsh, Lirong Xia
Comments (0)
books