Friedgut, Kalai, and Nisan have proved that social choice functions can be successfully manipulated by random preference reordering with non- negligible probability. However, their results require two restrictions: the social choice function must be neutral, and the election must have at most 3 alternatives. In this thesis we focus on removing the latter restriction and generalizing the results to elections with any number of candidates. We also provide a survey of related work analyzing and comparing results from a number of authors.
Library of Congress Subject Headings
Social choice--Mathematical models; Elections--Mathematical models
Computer Science (MS)
Department, Program, or Center
Computer Science (GCCIS)
Potter, Jonathan, "A Generalized Probabilistic Gibbard-Satterthwaite Theorem" (2014). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus