Thumbnail - Request a copy

A Reduction of the Complexity of Inconsistencies Test in the MACBETH 2-Additive Methodology

Labreuche, Christophe; Grabisch, Michel; Mayag, Brice (2011), A Reduction of the Complexity of Inconsistencies Test in the MACBETH 2-Additive Methodology, in Tsoukiàs, Alexis; Roberts, Fred S.; Brafman, Ronen I., Algorithmic Decision Theory. Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings, Springer : Berlin, p. 178-189. http://dx.doi.org/10.1007/978-3-642-24873-3_14

Type
Communication / Conférence
Date
2011
Conference title
ADT 2011
Conference date
2011-10
Conference city
Piscataway
Conference country
États-Unis
Book title
Algorithmic Decision Theory. Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings
Book author
Tsoukiàs, Alexis; Roberts, Fred S.; Brafman, Ronen I.
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
6992
Published in
Berlin
ISBN
978-3-642-24872-6
Pages
178-189
Publication identifier
Metadata
Show full item record
Author(s)
Labreuche, Christophe
Grabisch, Michel cc
Mayag, Brice
Abstract (EN)
MACBETH 2-additive is the generalization of the Choquet integral to the MACBETH approach, a MultiCriteria Decision Aid method. In the elicitation of a 2-additive capacity step, the inconsistencies of the preferential information, given by the Decision Maker on the set of binary alternatives, is tested by using the MOPI conditions. Since a 2-additive capacity is related to all binary alternatives, this inconsistencies checking can be more complex if the set of alternatives is very large. In this paper, we show that it is possible to limited the test of MOPI conditions to the only alternatives used in the preferential information.
Subjects / Keywords
MOPI conditions; Preference modeling; MCDA; MACBETH; Choquet integral