Abstract: The concept and approach of aggregative rank is given.Three kinds of alternative relations are proposed.Based on these relations,three alternative sets are defined with respect to each alternative.The aggregative rank is then defined and the algorithm for obtaining the aggregative rank from an alternative set is proposed.The time complexity is analyzed.The worst-case time complexity of the algorithm is O（n<sup<3</sup<）.The aggregative rank index and the aggregative precedence relation between the alternatives are proposed.Stability analysis of the aggregative rank is performed.The sufficient conditions for the stability of the aggregative rank are then obtained.Finally,an illustrative example is（given.）