Name
Abstract | ||
|---|---|---|
Sorting models consist in assigning alternatives evaluated on several criteria to ordered categories. To implement such models it is necessary to set the values of the preference parameters used in the model. Rather than fixing the values of these parameters directly, a usual approach is to infer these values from assign- ment examples provided by the decision maker (DM), i.e., alternatives for which (s)he specifies a required category. However, assignment examples provided by DMs can be inconsistent, i.e., may not match the sorting model. In such situations, it is necessary to support the DMs in the resolution of this inconsistency. In this paper, we extend algorithms from Mousseau et al. (2003) that calculate different ways to remove assignment examples so that the information can be represented in the sorting model. The extension concerns the possibility to relax (rather than to delete) assignment examples. These algorithms incorporate information about the confidence attached to each assignment example, hence providing inconsistency resolutions that the DMs are most likely to accept. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s10288-005-0076-8 | 4OR |
Keywords | DocType | Volume |
inconsistency analysis,sorting problem,multicriteria decision aiding | Journal | 4 |
Issue | ISSN | Citations |
2 | 1614-2411 | 8 |
PageRank | References | Authors |
0.64 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincent Mousseau | 1 | 808 | 50.52 |
| Luis C. Dias | 2 | 371 | 28.34 |
| José Figueira | 3 | 144 | 8.89 |