CONDORCET CONSISTENCY AND PAIRWISE JUSTIFIABILITY UNDER VARIABLE AGENDAS
比较了集体选择函数中孔多塞一致性与成对可辩护性两种要求，证明在匿名和中立规则下两者等价，适用于通用、单峰等偏好域。
Abstract We compare the consequences of imposing upon collective choice functions the classical requirement of Condorcet consistency with those arising when requiring the functions to satisfy the principle of pairwise justifiability. We show that, despite the different logic underlying these two requirements, they are equivalent when applied to anonymous and neutral rules defined over a class of domains. The class contains the universal, the single‐peaked, and that of order restriction, among other preference domains.