Optimal Voting Mechanisms on Generalized Single-Peaked Domains
研究了在广义单峰偏好（来自中位数空间）下，满足策略证明性、匿名性和满射性的社会福利最大化投票规则，最优机制由灵活多数要求的二元投票组成。
This paper studies the design of voting mechanisms. There are multiple alternatives, and the voters have generalized single-peaked preferences derived from median spaces as introduced in Nehring and Puppe (2007b). This class of preferences covers a wide range of economically relevant domains, and it is much larger than the well-known single-peaked preferences on a line. I characterize the welfare-maximizing voting rules among all social choice functions satisfying strategy-proofness, anonymity, and surjectivity. The optimal mechanisms are composed of binary votes on subsets of alternatives involving flexible majority requirements.