Related papers: Representation of preferences for multiple criteria decision aiding in a new seven-valued logic

Representation of preferences for multiple criteria decision aiding in a new seven-valued logic

URL: http://arxiv.org/abs/2406.03501v1
Date: Fri, 31 May 2024 18:59:24 GMT
Title: Representation of preferences for multiple criteria decision aiding in a new seven-valued logic
Authors: Salvatore Greco, Roman Słowiński,
Abstract summary: We show how the seven-valued logic can be used to represent preferences in the domain of Multiple Criteria Decision Aiding. In particular, we propose new forms of outranking and value function preference models that aggregate multiple criteria taking into account imperfect preference information.
Score: 0.4849550522970841
License: http://creativecommons.org/licenses/by/4.0/
Abstract: The seven-valued logic considered in this paper naturally arises within the rough set framework, allowing to distinguish vagueness due to imprecision from ambiguity due to coarseness. Recently, we discussed its utility for reasoning about data describing multi-attribute classification of objects. We also showed that this logic contains, as a particular case, the celebrated Belnap four-valued logic. Here, we present how the seven-valued logic, as well as the other logics that derive from it, can be used to represent preferences in the domain of Multiple Criteria Decision Aiding (MCDA). In particular, we propose new forms of outranking and value function preference models that aggregate multiple criteria taking into account imperfect preference information. We demonstrate that our approach effectively addresses common challenges in preference modeling for MCDA, such as uncertainty, imprecision, and ill-determination of performances and preferences. To this end, we present a specific procedure to construct a seven-valued preference relation and use it to define recommendations that consider robustness concerns by utilizing multiple outranking or value functions representing the decision maker s preferences. Moreover, we discuss the main properties of the proposed seven-valued preference structure and compare it with current approaches in MCDA, such as ordinal regression, robust ordinal regression, stochastic multiattribute acceptability analysis, stochastic ordinal regression, and so on. We illustrate and discuss the application of our approach using a didactic example. Finally, we propose directions for future research and potential applications of the proposed methodology.

Related papers

An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting [53.36437745983783]
We first construct a max-margin optimization-based model to model potentially non-monotonic preferences. We devise information amount measurement methods and question selection strategies to pinpoint the most informative alternative in each iteration. Two incremental preference elicitation-based algorithms are developed to learn potentially non-monotonic preferences.
arXiv Detail & Related papers (2024-09-04T14:36:20Z)
Preference-Based Abstract Argumentation for Case-Based Reasoning (with Appendix) [9.5382175632919]
We introduce Preference-Based Abstract Argumentation for Case-Based Reasoning (which we call AA-CBR-P) This allows users to define multiple approaches to compare cases with an ordering that specifies their preference over these comparison approaches. We show empirically that our approach outperforms other interpretable machine learning models on a real-world medical dataset.
arXiv Detail & Related papers (2024-07-31T18:31:04Z)
Domain Generalization via Rationale Invariance [70.32415695574555]
This paper offers a new perspective to ease the challenge of domain generalization, which involves maintaining robust results even in unseen environments. We propose treating the element-wise contributions to the final results as the rationale for making a decision and representing the rationale for each sample as a matrix. Our experiments demonstrate that the proposed approach achieves competitive results across various datasets, despite its simplicity.
arXiv Detail & Related papers (2023-08-22T03:31:40Z)
Robust Ordinal Regression for Subsets Comparisons with Interactions [2.6151761714896122]
This paper is dedicated to a robust ordinal method for learning the preferences of a decision maker between subsets. The decision model, derived from Fishburn and LaValle, is general enough to be compatible with any strict weak order on subsets. A predicted preference is considered reliable if all the simplest models (Occam's razor) explaining the preference data agree on it.
arXiv Detail & Related papers (2023-08-07T07:54:33Z)
Representing and Reasoning with Multi-Stakeholder Qualitative Preference Queries [9.768677073327423]
We offer the first formal treatment of reasoning with multi-stakeholder qualitative preferences. We introduce a query for expressing queries against such preferences over sets of outcomes that satisfy specified criteria. We present experimental results that demonstrate the feasibility of our approach.
arXiv Detail & Related papers (2023-07-30T19:52:59Z)
Selection of a representative sorting model in a preference disaggregation setting: a review of existing procedures, new proposals, and experimental comparison [4.447467536572626]
We consider preference disaggregation in the context of multiple criteria sorting. Given the multiplicity of sorting models compatible with indirect preferences, selecting a single, representative one can be conducted differently. We present three novel procedures that implement the robust assignment rule in practice.
arXiv Detail & Related papers (2022-08-30T02:01:35Z)
Characterizing Fairness Over the Set of Good Models Under Selective Labels [69.64662540443162]
We develop a framework for characterizing predictive fairness properties over the set of models that deliver similar overall performance. We provide tractable algorithms to compute the range of attainable group-level predictive disparities. We extend our framework to address the empirically relevant challenge of selectively labelled data.
arXiv Detail & Related papers (2021-01-02T02:11:37Z)
Probabilistic Case-based Reasoning for Open-World Knowledge Graph Completion [59.549664231655726]
A case-based reasoning (CBR) system solves a new problem by retrieving cases' that are similar to the given problem. In this paper, we demonstrate that such a system is achievable for reasoning in knowledge-bases (KBs) Our approach predicts attributes for an entity by gathering reasoning paths from similar entities in the KB.
arXiv Detail & Related papers (2020-10-07T17:48:12Z)
Evaluations and Methods for Explanation through Robustness Analysis [117.7235152610957]
We establish a novel set of evaluation criteria for such feature based explanations by analysis. We obtain new explanations that are loosely necessary and sufficient for a prediction. We extend the explanation to extract the set of features that would move the current prediction to a target class.
arXiv Detail & Related papers (2020-05-31T05:52:05Z)
Invariant Rationalization [84.1861516092232]
A typical rationalization criterion, i.e. maximum mutual information (MMI), finds the rationale that maximizes the prediction performance based only on the rationale. We introduce a game-theoretic invariant rationalization criterion where the rationales are constrained to enable the same predictor to be optimal across different environments. We show both theoretically and empirically that the proposed rationales can rule out spurious correlations, generalize better to different test scenarios, and align better with human judgments.
arXiv Detail & Related papers (2020-03-22T00:50:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.