444 research outputs found

    Preassociative aggregation functions

    Get PDF
    The classical property of associativity is very often considered in aggregation function theory and fuzzy logic. In this paper we provide axiomatizations of various classes of preassociative functions, where preassociativity is a generalization of associativity recently introduced by the authors. These axiomatizations are based on existing characterizations of some noteworthy classes of associative operations, such as the class of Acz\'elian semigroups and the class of t-norms.Comment: arXiv admin note: text overlap with arXiv:1309.730

    Solving multi-criteria decision problems under possibilistic uncertainty using optimistic and pessimistic utilities

    Get PDF
    International audienceThis paper proposes a qualitative approach to solve multi-criteria decision making problems under possibilistic uncertainty. De-pending on the decision maker attitude with respect to uncertainty (i.e. optimistic or pessimistic) and on her attitude with respect to criteria (i.e. conjunctive or disjunctive), four ex-ante and four ex-post decision rules are dened and investigated. In particular, their coherence w.r.t. the principle of monotonicity, that allows Dynamic Programming is studied

    Contribution on some construction methods for aggregation functions

    Get PDF
    Abstract. In this paper, based on [14], we present some well established construction methods for aggregation functions as well as some new ones

    Subset sum phase transitions and data compression

    Full text link
    We propose a rigorous analysis approach for the subset sum problem in the context of lossless data compression, where the phase transition of the subset sum problem is directly related to the passage between ambiguous and non-ambiguous decompression, for a compression scheme that is based on specifying the sequence composition. The proposed analysis lends itself to straightforward extensions in several directions of interest, including non-binary alphabets, incorporation of side information at the decoder (Slepian-Wolf coding), and coding schemes based on multiple subset sums. It is also demonstrated that the proposed technique can be used to analyze the critical behavior in a more involved situation where the sequence composition is not specified by the encoder.Comment: 14 pages, submitted to the Journal of Statistical Mechanics: Theory and Experimen
    corecore