The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding t...The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding to the joint efficient ordering method are studied, and some necessary conditions of this mapping are proven.展开更多
Rationality condition is imposed in Arrow's General Possibility Theorem in order for social choice to be independent of the path of choice. In this Paper, emphasis is laid on the analysis of the relevance of path ...Rationality condition is imposed in Arrow's General Possibility Theorem in order for social choice to be independent of the path of choice. In this Paper, emphasis is laid on the analysis of the relevance of path independence and rationality condition. Two kinds of Path independence, i.e., Plott's path independence and Bandyopadhyay's sequential path independence, are shown, and their meanings with respect to the problem are investigated.展开更多
基金The research is supported by National Natural Science Foundation of China under Grant No. 70071026 Science Foundation of Wenzhou University and Science Foundation of School of Mathematics and Information Science, Wenzhou University and Zhejiang Province Education Department Scientific Research Item.
文摘The joint efficient ordering method is a fundamental method of ordering alternatives in group multi-objective programming problems. In this paper, the rational properties of the joint efficient mapping corresponding to the joint efficient ordering method are studied, and some necessary conditions of this mapping are proven.
文摘Rationality condition is imposed in Arrow's General Possibility Theorem in order for social choice to be independent of the path of choice. In this Paper, emphasis is laid on the analysis of the relevance of path independence and rationality condition. Two kinds of Path independence, i.e., Plott's path independence and Bandyopadhyay's sequential path independence, are shown, and their meanings with respect to the problem are investigated.
