摘要
This paper clarifies, how a preference aggregation problem can be solved using the prioritized aggregation operators (PAO), where, a given group of candidates should be aggregated based upon their satisfaction for a collection of ranked places. The comparison results show that the proposed method can accurate aggregate a preference ranking system with less computation and without the need to solve any mathematical model. Also, a metasearch application shows the usefulness of applying the PAO for a preference aggregation.
- 出版日期2010-10