DICTATORIAL CONSENSUS FUNCTIONS ON N-TREES

作     者：BARTHELEMY, JP MCMORRIS, FR POWERS, RC 

作者机构：UNIV LOUISVILLEDEPT MATHLOUISVILLEKY 40292 ENST BRETAGNEINTELLIGENCE ARTIFICIELLE & SYST COGNIT LABF-29285 BRESTFRANCE 

出 版 物：《MATHEMATICAL SOCIAL SCIENCES》 (数学社会科学)

年 卷 期：1992年第25卷第1期

页      面：59-64页

核心收录：

学科分类：0201[经济学-理论经济学] 07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：CONSENSUS FUNCTIONS N-TREES INDEPENDENCE CONDITIONS 

摘      要：The original independence of irrelevant alternatives axiom of K. Arrow has a natural analog when translated from the classical weak order (preference relation) case to n-trees. Using this translated independence axiom for n-trees, it is surprising that Arrow s impossibility Theorem does not follow. Specifically, there exist consensus functions for n-trees that satisfy the independence and Pareto conditions but are not dictatorships. Conversely, a dictatorship must clearly satisfy the Pareto condition but not necessarily independence. In this note it is shown that a consensus function for n-trees is a dictatorship and satisfies independence if and only if it is a projection function.