Constructing an objective function for aggregating incomplete preferences

MaRDI QIDQ4363009zbMATH OpenFDO

Authors Pavel Chebotarev, Elena Shamis

Publication date 13 November 1997

zbMATH Keywords

discrete optimizationincomplete preferencesKemeny mediamatrices of paired comparisonspreference aggregationquadratic assignmentself-consistent monotonicity

Mathematics Subject Classification ID

Integer programming (90C10) Applications of mathematical programming (90C90) Individual preferences (91B08) Utility theory (91B16)

Recommendations

• On optimization models for aggregating incomplete preferences
• Preference fusion when the number of alternatives exceeds two: Indirect scoring procedures
• Aggregation of preferences by the generalized row sum method
• Intransitive preference relations and preference differences

Cited in

(9)

• Constructing scalar-valued objective functions. Proceedings of the 3rd international conference on Econometric decision models: constructing scalar-valued objective functions, University of Hagen, Katholische Akademie Schwerte, Schwerte, Germany, September 5--8, 1995
• Aggregation of preferences by the generalized row sum method
• Fair elimination-type competitions
• Paired comparisons analysis: an axiomatic approach to ranking methods
• An impossibility theorem for paired comparisons
• On optimization models for aggregating incomplete preferences
• Some impossibilities of ranking in generalized tournaments
• A continuous logical method of uniting individual object preference estimates
• The Copeland ratio ranking method for abstract decision problems

This page was built for publication: Constructing an objective function for aggregating incomplete preferences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363009)