Game theoretic analysis for collective choice problems and the strategy-proofness

点击翻译按钮获取中文摘要

This research is about collective choice rules that choose a subset of alternative set, given each individual's preference over the alternatives. If some individual can secure a single outcome that he prefers to the single outcome when he is honest by falsifying his preference, the procedure is manipulable. Nonmanipulable voting rules are called strategy-proof. In particular, this study focused on the strategy-proof collective choice rules. The main results show that Pareto rule is coalitionally strategy-proof in a max-min sense, and that the maximal rule with the coalitionally strategy-proofness and nonimposition property is the Pareto rule.