| An Impossibility Theorem for Nonbinary Social Choice |
| |
| 作者姓名： | LUO Yunfeng XIAO Renbin ZHU Mingfu |
| |
| 作者单位： | LUO Yunfeng; XIAO Renbin; ZHU Mingfu(Institute of Systems Engheering)(Huazhong University of Science and Technology，Wuhan 430074，P.R. China) |
| |
| 摘 要： | 1IntroductionArrow'sproofforarrow'sgeneralpossibilitytheorem(GPT)standsontheconditionthatsocialchoiceisdefinedoverailpairsofalternativesl'l,whereas,inmosteconomicproblems,thesetoffeasiblealternativescontainsmorethantwoelements.IthasbeensuspectedthattherootoftheaggregationproblemsencounteredinthetheoryofsocialchoicedoesnotlieinthisspecialaspectofArrow'sframework.Thismotivatesthesearchfornonbinaryimpossibilitytheoremsl2].Inadelicatepaper,GretherandPlotthaveshownthatArrow'sGPTholdswhenailfini…
|
An Impossibility Theorem for Nonbinary Social Choice |
| |
| LUO Yunfeng, XIAO Renbin, ZHU Mingfu.An Impossibility Theorem for Nonbinary Social Choice[J].Journal of Systems Science and Systems Engineering,1999(2). |
| |
| Authors: | LUO Yunfeng XIAO Renbin ZHU Mingfu |
| |
| Abstract: | 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. |
| |
| Keywords: | social choice impossibility theorem binariness nonbinny social choice |
| 本文献已被 CNKI 等数据库收录！ |
