Deriving a minimum distance-based collective preorder: a binary mathematical programming approach
From MaRDI portal
Publication:421078
DOI10.1007/s00291-009-0192-5zbMath1238.90077MaRDI QIDQ421078
Khaled Jabeur, Jean-Marc Martel, Adel Guitouni
Publication date: 23 May 2012
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-009-0192-5
distance measure; group decision-making; binary relations; binary linear programming; members' relative importance; preferences aggregation
90C29: Multi-objective and goal programming
90B50: Management decision making, including multiple objectives
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A collective choice method based on individual preferences relational systems (p.r.s.)
- An ordinal sorting method for group decision-making
- A new index of power for simple n-person games
- Group preference aggregation methods employed in AHP: An evaluation and an intrinsic process for deriving members' weightages
- Determining the weights of criteria in the ELECTRE type methods with a revised Simos' procedure
- Distance-based and ad hoc consensus models in ordinal preference ranking
- An axiomatic approach to distance on partial orderings
- Ordinal Ranking with Intensity of Preference
- Priority Ranking and Consensus Formation
- Group Decision Making Using Cardinal Social Welfare Functions
- Criterion of distance between technical programming and socio-economic priority
- IMGD: an interactive method for multiobjective group decision aid
- Reaching a Consensus