We define different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of the mand whose ranges consist of two alternatives, in terms of two types of basic properties.
Published as: Group Strategy-Proof Social Choice Functions with Binary Ranges and Arbitrary Domains: Characterization Results in International Journal of Game Theory , Vol. 41, No. 4, 791--808, January, 2012