Existence of Order-Preserving Functions for Nontotal Fuzzy Preference Relations under Decisiveness

Looking at decisiveness as crucial, we discuss the existence of an order-preserving function for the nontotal crisp preference relation naturally associated to a nontotal fuzzy preference relation. We further present conditions for the existence of an upper semicontinuous order-preserving function for a fuzzy binary relation on a crisp topological space

Open questions in utility theory

Throughout this paper, our main idea is to explore different classical questions arising in Utility Theory, with a particular attention to those that lean on numerical representations of preference orderings. We intend to present a survey of open questions in that discipline, also showing the state-of-art of the corresponding literature.This work is partially supported by the research projects ECO2015-65031-R, MTM2015-63608-P (MINECO/ AEI-FEDER, UE), and TIN2016-77356-P (MINECO/ AEI-FEDER, UE)

The Basic Principles of Uncertain Information Fusion. An organized review of merging rules in different representation frameworks

We propose and advocate basic principles for the fusion of incomplete or uncertain information items, that should apply regardless of the formalism adopted for representing pieces of information coming from several sources. This formalism can be based on sets, logic, partial orders, possibility theory, belief functions or imprecise probabilities. We propose a general notion of information item representing incomplete or uncertain information about the values of an entity of interest. It is supposed to rank such values in terms of relative plausibility, and explicitly point out impossible values. Basic issues affecting the results of the fusion process, such as relative information content and consistency of information items, as well as their mutual consistency, are discussed. For each representation setting, we present fusion rules that obey our principles, and compare them to postulates specific to the representation proposed in the past. In the crudest (Boolean) representation setting (using a set of possible values), we show that the understanding of the set in terms of most plausible values, or in terms of non-impossible ones matters for choosing a relevant fusion rule. Especially, in the latter case our principles justify the method of maximal consistent subsets, while the former is related to the fusion of logical bases. Then we consider several formal settings for incomplete or uncertain information items, where our postulates are instantiated: plausibility orderings, qualitative and quantitative possibility distributions, belief functions and convex sets of probabilities. The aim of this paper is to provide a unified picture of fusion rules across various uncertainty representation settings

Robust rank correlation coefficients on the basis of fuzzy

The goal of this paper is to demonstrate that established rank correlation measures are not ideally suited for measuring rank correlation for numerical data that are perturbed by noise. We propose to use robust rank correlation measures based on fuzzy orderings. We demonstrate that the new measures overcome the robustness problems of existing rank correlation coe cients. As a rst step, this is accomplished by illustrative examples. The paper closes with an outlook on future research and applicationsPeer Reviewe

Proposition structure in framed decision problems: A formal representation.

Framing effects, which may induce decision-makers to demonstrate preference description invariance violation for logically equivalent options varying in semantic emphasis, are an economically significant decision bias and an active area of research. Framing is an issue inter alia for the way in which options are presented in stated-choice studies where (often inadvertent) semantic emphasis may impact on preference responses. While research into both espoused preference effects and its cognitive substrate is highly active, interpretation and explanation of preference anomalies is beset by variation in the underlying structure of problems and latitude for decision-maker elaboration. A formal, general scheme for making transparent the parameter and proposition structure of framed decision stimuli is described. Interpretive and cognitive explanations for framing effects are reviewed. The formalism’s potential for describing extant, generating new stimulus tasks, detailing decision-maker task elaboration. The approach also provides a means of formalising stated-choice response stimuli and provides a metric of decision stimuli complexity. An immediate application is in the structuring of stated-choice test instruments

A Declarative Semantics for CLP with Qualification and Proximity

Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values as a generalization of uncertain truth values, and unification based on proximity relations. On the other hand, the CLP scheme has established itself as a powerful extension of LP that supports efficient computation over specialized domains while keeping a clean declarative semantics. In this paper we propose a new scheme SQCLP designed as an extension of CLP that supports qualification values and proximity relations. We show that several previous proposals can be viewed as particular cases of the new scheme, obtained by partial instantiation. We present a declarative semantics for SQCLP that is based on observables, providing fixpoint and proof-theoretical characterizations of least program models as well as an implementation-independent notion of goal solutions.Comment: 17 pages, 26th Int'l. Conference on Logic Programming (ICLP'10

A note on representation of references

We consider a class of relations which includes irreflexive preference relations and interdependent preferences. For this class, we obtain necessary and sufficient conditions for representation of the relation by two numerical functions in the sense of a < x if and only if u(a) < v(x)