Related papers: Fuzzy Arrovian Theorems when preferences are compl…
This book gives the basic notions of fuzzy matrix theory and its applications to simple fuzzy models. The approach is non-traditional in order to attract many students to use this methodology in their research. The traditional approach of…
This article addresses the problem of expressing preferences in flexible queries while basing on a combination of the fuzzy logic theory and Conditional Preference Networks or CP-Nets.
Fuzzy modeling has many advantages over the non-fuzzy methods, such as robustness against uncertainties and less sensitivity to the varying dynamics of nonlinear systems. Data-driven fuzzy modeling needs to extract fuzzy rules from the…
In line with the increasing attention paid to deal with uncertainty in ordinal data models, we propose to combine Fuzzy models with \cub models within questionnaire analysis. In particular, the focus will be on \cub models' uncertainty…
It is a consequence of the axiom of choice that every preorder can be extended to a total preorder while respecting the strict preorder relation. We call such an extension a prelinearization of the preorder and study the extent to which the…
In the paper there is studied an optimal saving model in which the interest-rate risk for saving is a fuzzy number. The total utility of consumption is defined by using a concept of possibilistic expected utility. A notion of possibilistic…
In this paper we review some properties of fuzzy observables, mainly as realized by commutative positive operator valued measures. In this context we discuss two representation theorems for commutative positive operator valued measures in…
A key problem in the application of first-order probabilistic methods is the enormous size of graphical models they imply. The size results from the possible worlds that can be generated by a domain of objects and relations. One of the…
We establish an equivalence between two seemingly different theories: one is the traditional axiomatisation of incomplete preferences on horse lotteries based on the mixture independence axiom; the other is the theory of desirable gambles…
Let $p$ be an odd prime and $S$ a nonabelian finite $p$-group. In [9, 10], they proposed the following conjecture: if $\mathcal{F}$ be a transitive fusion system over a finite $p$-group $S$, then $S$ is either extraspecial of order $p^{3}$…
At the first, we revise the Kosinski definition of the sum of ordered fuzzy numbers. The associativity of revised sum is investigated here. In addition, we show that the multiple revised sum of finite sequence of trapezoidal ordered fuzzy…
The rough-set theory proposed by Pawlak, has been widely used in dealing with data classification problems. The original rough-set model is, however, quite sensitive to noisy data. Tzung thus proposed deals with the problem of producing a…
In this paper, an optimization model with a linear objective function subjected to a system of fuzzy relation equations (FRE) is studied where the feasible region is defined by the Dombi t-norm. Dombi family of t-norms includes a parametric…
The paper investigates the properties of a fuzzy logic of typicality. The extension of fuzzy logic with a typicality operator was proposed in recent work to define a fuzzy multipreference semantics for Multilayer Perceptrons, by regarding…
We advance a general theory of coherent preference that surrenders restrictions embodied in orthodox doctrine. This theory enjoys the property that any preference system admits extension to a complete system of preferences, provided it…
We propose randomized confidence intervals based on the Neyman-Pearson lemma, in order to make them more broadly applicable to distributions that do not satisfy regularity conditions. This is achieved by using the definition of fuzzy…
Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments…
We consider a school choice matching model where the priorities for schools are represented by binary relations that may not be weak order. We focus on the (total order) extensions of the binary relations. We introduce a class of algorithms…
We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…
The paper considers general multiplicative models for complete and incomplete contingency tables that generalize log-linear and several other models and are entirely coordinate free. Sufficient conditions of the existence of maximum…