Group strategy-proof rules in multidimensional binary domains
研究了在备选方案为二元向量且偏好由汉明距离决定时，满足一致性、匿名性和分量中立性的规则，发现分量多数规则在特定条件下具有策略证明性，但超过三个分量和四个代理人时不存在强群体策略证明规则。
Abstract We consider a setting in which the alternatives are binary vectors and the preferences of the agents are determined by the Hamming distance from their most preferred alternatives. We consider only rules that are unanimous, anonymous, and component-neutral, and focus on strategy-proofness, weak group strategy-proofness, and strong group strategy-proofness. We show that component-wise majority rules are strategy-proof, and for three agents or two components also weakly group strategy-proof, but not otherwise. These rules are even strongly group strategy-proof if there are two or three agents. Our main result is an impossibility result: if there are at least four agents and at least three components, then no rule is strongly group strategy-proof.