Anonymous, non-manipulable, binary social choice
Abstract
Let V be a finite society whose members express weak orderings (hence also indifference, possibly) about two alternatives. We show a simple representation formula that is valid for all, and only, anonymous, non-manipulable, binary social choice functions on V . The number of such functions is 2n+1 if V contains n agents.
0