An Impossibility Theorem for Nonbinary Social Choice

被引:1
|
作者
LUO Yunfeng
XIAO Renbin
ZHU Mingfu(Institute of Systems Engheering)(Huazhong University of Science and Technology
机构
关键词
social choice; impossibility theorem; binariness; nonbinny social choice;
D O I
暂无
中图分类号
N94 [系统科学];
学科分类号
0711 ; 081103 ; 1201 ;
摘要
In Arrow’s General Possibility Theorem (GPT), social choice should be defined over allpairs of alternatives. In this paper, we generalize Arrow’s GPT to situations where choice over pairs ofalternatives may not be possible. This shows that Arrow’s GPT and related impossibility results canbe established without binariness of social choice.
引用
收藏
页码:198 / 202
页数:5
相关论文
共 50 条