Abstract
We study the Yager OWS aggregation and the Irregular normalized Yager OWA aggregation under infinite environment. Two evaluation problems are proposed to motivate their applications. Few distinguishing properties are discussed. We show that such aggregations use the same type of weights, infinite weights (sequence), to embody the involved preferences. Their respective applications in the fields of Scientometrics and Gradual Confidence Aggregation are proposed and analyzed.