19 research outputs found

    Measure and integral with purely ordinal scales

    Get PDF
    We develop a purely ordinal model for aggregation functionals for lattice valued functions, comprising as special cases quantiles, the Ky Fan metric and the Sugeno integral. For modeling findings of psychological experiments like the reflection effect in decision behaviour under risk or uncertainty, we introduce reflection lattices. These are complete linear lattices endowed with an order reversing bijection like the reflection at 00 on the real interval [1,1][-1,1]. Mathematically we investigate the lattice of non-void intervals in a complete linear lattice, then the class of monotone interval-valued functions and

    Aggregation functions: Means

    Get PDF
    The two-parts state-of-art overview of aggregation theory summarizes the essential information concerning aggregation issues. Overview of aggregation properties is given, including the basic classification of aggregation functions. In this first part, the stress is put on means, i.e., averaging aggregation functions, both with fixed arity (n-ary means) and with open arity (extended means).

    Bipolar Fuzzy Integrals

    Get PDF
    In decision analysis and especially in multiple criteria decision analysis, several non additive integrals have been introduced in the last sixty years. Among them, we remember the Choquet integral, the Shilkret integral and the Sugeno integral. Recently, the bipolar Choquet integral has been proposed for the case in which the underlying scale is bipolar. In this paper we propose the bipolar Shilkret integral and the bipolar Sugeno integral. Moreover, we provide an axiomatic characterization of all these three bipolar fuzzy integrals.Comment: 15 page

    The Möbius transform on symmetric ordered structures and its application to capacities on finite sets

    Get PDF
    Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry necessarily entails non associativity, hence computing rules are defined in order to deal with non associativity. We study in details computing rules, which we endow with a partial order. This permits to find solutions to the inversion formula underlying the Möbius transform. Then we apply these results to the case of capacities, a notion from decision theory which corresponds, in the language of ordered sets, to order preserving mappings, preserving also top and bottom. In this case, the solution of the inversion formula is called the Möbius transform of the capacity. Properties and examples of Möbius transform of sup-preserving and inf-preserving capacities are given.

    Complementary Lipschitz continuity results for the distribution of intersections or unions of independent random sets in finite discrete spaces

    Get PDF
    We prove that intersections and unions of independent random sets in finite spaces achieve a form of Lipschitz continuity. More precisely, given the distribution of a random set Ξ\Xi, the function mapping any random set distribution to the distribution of its intersection (under independence assumption) with Ξ\Xi is Lipschitz continuous with unit Lipschitz constant if the space of random set distributions is endowed with a metric defined as the LkL_k norm distance between inclusion functionals also known as commonalities. Moreover, the function mapping any random set distribution to the distribution of its union (under independence assumption) with Ξ\Xi is Lipschitz continuous with unit Lipschitz constant if the space of random set distributions is endowed with a metric defined as the LkL_k norm distance between hitting functionals also known as plausibilities. Using the epistemic random set interpretation of belief functions, we also discuss the ability of these distances to yield conflict measures. All the proofs in this paper are derived in the framework of Dempster-Shafer belief functions. Let alone the discussion on conflict measures, it is straightforward to transcribe the proofs into the general (non necessarily epistemic) random set terminology
    corecore