非二元性选择函数的Arrow不可能性定理  

An Impossibility Theorem for Nonbinary Social Choice

作　　者：罗云峰[1] 朱明富[1] 岳超源[1] 陈珽[1] 

机构地区：[1]华中理工大学系统工程研究所,武汉430074

出　　处：《系统工程》1998年第3期13-20,共8页Systems Engineering

基　　金：国家自然科学基金(69504005)资助项目

摘　　要：本文研究了非二元性选择问题,通过构造非二元性选择函数形式的不可能性定理,证明了在非二元性选择环境下Arrow不可能定理仍然成立.所得结论表明导致选择函数形式的不可能性结论的根本原因不是选择函数的“二元性”.Arrow's General Possibility Theorem (GPT) and related impossibility results are primarily due to the inclusion of pairs of alternatives in the domain of social choice function. But. in this paper, we propose a nonbinary impossibility theorem which is the counterpart of Arrow's GPT to situations where choice over pairs of alternatives is not possible. This shows that Arrow's GPT and related impossibility results can be established without binariness of social choice.

关 键 词：选择函数 非二元性 展示偏好 不可能性定理 

分 类 号：O174.1[理学—数学]