Application of prioritized aggregation operators in preference voting | Zendy

Amin Gholam R. | Zendy; Sadeghi Hamid | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Application of prioritized aggregation operators in preference voting

Author(s) -

Amin Gholam R.,

Sadeghi Hamid

Publication year - 2010

Publication title -

international journal of intelligent systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.291

H-Index - 87

eISSN - 1098-111X

pISSN - 0884-8173

DOI - 10.1002/int.20437

Subject(s) - preference , aggregation problem , ranking (information retrieval) , aggregate (composite) , computer science , voting , computation , data mining , artificial intelligence , information retrieval , algorithm , mathematics , statistics , mathematical economics , materials science , politics , political science , law , composite material

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 Wiley Periodicals, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research