The Gibbard-Satterthwaite Theorem on the manipulability of collective-choice procedures treats only of resolute procedures. Few real or reasonable procedures are resolute. We prove a generalization of Gibbard-Satterthwaite that covers the nonresolute case. It opens harder questions than it answers about the prediction of behavior and outcomes and the design of institutions
