偏好关系的表示和收缩

针对偏好经常会改变的问题，提出偏好的舍弃操作——偏好收缩，而对于偏好收缩来说，偏好收缩的最小化和保持严格偏序性是很重要的。给出可用于表示有限和无限偏好关系的框架，并针对偏好的收缩问题提出算法，计算偏好关系对基本收缩的全收缩，使收缩后的偏好满足严格偏序，对全收缩进行最小化，得到修正后的偏好全收缩。仿真结果表明，修正后的全收缩小于修正前的全收缩。

Representation and Contraction of Preference Relations

Aiming at the problem that changing preferences is very common,this paper proposes the operation of discarding preferences—— preference contraction.The property of minimality and the preservation of strict partial orders are crucial for contractions.It presents framework which can deal with finite as well as infinite preference relations.It gives algorithms for computing contractions for preference relations.It computes full contractor of a preference relation by base contractors to preserve strict partial orders in the modified preference relation.It minimizes the full contractor,and obtains the modified full contractor.Simulation results show that the size of full contractor after revision is obvious smaller than before.