论文标题
匿名，不可操纵的二进制社会选择
Anonymous, non-manipulable, binary social choice
论文作者
论文摘要
让V为一个有限的社会，其成员对两种替代方案表达薄弱的顺序（因此也可能是冷漠的）。我们展示了一个简单的表示公式，该公式对所有人有效，唯一的匿名，不可操纵的，二进制的社交选择功能。如果V包含$ N $代理，则此类功能的数量为$ 2^{n+1} $。
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 $2^{n+1}$ if V contains $n$ agents.
