1,781 research outputs found

    Capacities and Games on Lattices: A Survey of Result

    Get PDF
    We provide a survey of recent developments about capacities (or fuzzy measures) and ccoperative games in characteristic form, when they are defined on more general structures than the usual power set of the universal set, namely lattices. In a first part, we give various possible interpretations and applications of these general concepts, and then we elaborate about the possible definitions of usual tools in these theories, such as the Choquet integral, the Möbius transform, and the Shapley value.capacity, fuzzy measure, game, lattice, Choquet integral,Shapley value

    A Recipe for State-and-Effect Triangles

    Full text link
    In the semantics of programming languages one can view programs as state transformers, or as predicate transformers. Recently the author has introduced state-and-effect triangles which capture this situation categorically, involving an adjunction between state- and predicate-transformers. The current paper exploits a classical result in category theory, part of Jon Beck's monadicity theorem, to systematically construct such a state-and-effect triangle from an adjunction. The power of this construction is illustrated in many examples, covering many monads occurring in program semantics, including (probabilistic) power domains

    ISIPTA'07: Proceedings of the Fifth International Symposium on Imprecise Probability: Theories and Applications

    Get PDF
    B

    Domination and Decomposition in Multiobjective Programming

    Get PDF
    During the last few decades, multiobjective programming has received much attention for both its numerous theoretical advances as well as its continued success in modeling and solving real-life decision problems in business and engineering. In extension of the traditionally adopted concept of Pareto optimality, this research investigates the more general notion of domination and establishes various theoretical results that lead to new optimization methods and support decision making. After a preparatory discussion of some preliminaries and a review of the relevant literature, several new findings are presented that characterize the nondominated set of a general vector optimization problem for which the underlying domination structure is defined in terms of different cones. Using concepts from linear algebra and convex analysis, a well known result relating nondominated points for polyhedral cones with Pareto solutions is generalized to nonpolyhedral cones that are induced by positively homogeneous functions, and to translated polyhedral cones that are used to describe a notion of approximate nondominance. Pareto-oriented scalarization methods are modified and several new solution approaches are proposed for these two classes of cones. In addition, necessary and sufficient conditions for nondominance with respect to a variable domination cone are developed, and some more specific results for the case of Bishop-Phelps cones are derived. Based on the above findings, a decomposition framework is proposed for the solution of multi-scenario and large-scale multiobjective programs and analyzed in terms of the efficiency relationships between the original and the decomposed subproblems. Using the concept of approximate nondominance, an interactive decision making procedure is formulated to coordinate tradeoffs between these subproblems and applied to selected problems from portfolio optimization and engineering design. Some introductory remarks and concluding comments together with ideas and research directions for possible future work complete this dissertation

    Set optimization - a rather short introduction

    Full text link
    Recent developments in set optimization are surveyed and extended including various set relations as well as fundamental constructions of a convex analysis for set- and vector-valued functions, and duality for set optimization problems. Extensive sections with bibliographical comments summarize the state of the art. Applications to vector optimization and financial risk measures are discussed along with algorithmic approaches to set optimization problems

    Belief functions on MV-algebras of fuzzy sets: An overview

    Get PDF
    Belief functions are the measure theoretical objects Dempster-Shafer evidence theory is based on. They are in fact totally monotone capacities, and can be regarded as a special class of measures of uncertainty used to model an agent's degrees of belief in the occurrence of a set of events by taking into account different bodies of evidence that support those beliefs. In this chapter we present two main approaches to extending belief functions on Boolean algebras of events to MV-algebras of events, modelled as fuzzy sets, and we discuss several properties of these generalized measures. In particular we deal with the normalization and soft-normalization problems, and on a generalization of Dempster's rule of combination. © 2014 Springer International Publishing Switzerland.The authors also acknowledge partial support by the FP7-PEOPLE-2009-IRSES project MaToMUVI (PIRSES-GA-2009- 247584). Also, Flaminio acknowledges partial support of the Italian project FIRB 2010 (RBFR10DGUA-002), Kroupa has been supported by the grant GACR 13-20012S, and Godo acknowledges partial support of the Spanish projects EdeTRI (TIN2012-39348-C02-01) and Agreement Technologies (CONSOLIDER CSD2007-0022, INGENIO 2010).Peer Reviewe

    Preference Modelling

    Get PDF
    This paper provides the reader with a presentation of preference modelling fundamental notions as well as some recent results in this field. Preference modelling is an inevitable step in a variety of fields: economy, sociology, psychology, mathematical programming, even medicine, archaeology, and obviously decision analysis. Our notation and some basic definitions, such as those of binary relation, properties and ordered sets, are presented at the beginning of the paper. We start by discussing different reasons for constructing a model or preference. We then go through a number of issues that influence the construction of preference models. Different formalisations besides classical logic such as fuzzy sets and non-classical logics become necessary. We then present different types of preference structures reflecting the behavior of a decision-maker: classical, extended and valued ones. It is relevant to have a numerical representation of preferences: functional representations, value functions. The concepts of thresholds and minimal representation are also introduced in this section. In section 7, we briefly explore the concept of deontic logic (logic of preference) and other formalisms associated with "compact representation of preferences" introduced for special purpoes. We end the paper with some concluding remarks

    LL-fuzzy ideal degrees in effect algebras

    Get PDF
    summary:In this paper, considering LL being a completely distributive lattice, we first introduce the concept of LL-fuzzy ideal degrees in an effect algebra EE, in symbol Dei\mathfrak{D}_{ei}. Further, we characterize LL-fuzzy ideal degrees by cut sets. Then it is shown that an LL-fuzzy subset AA in EE is an LL-fuzzy ideal if and only if Dei(A)=,\mathfrak{D}_{ei}(A)=\top, which can be seen as a generalization of fuzzy ideals. Later, we discuss the relations between LL-fuzzy ideals and cut sets (LβL_{\beta}-nested sets and LαL_{\alpha}-nested sets). Finally, we obtain that the LL-fuzzy ideal degree is an (L,L)(L,L)-fuzzy convexity. The morphism between two effect algebras is an (L,L)(L,L)-fuzzy convexity-preserving mapping

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

    Get PDF
    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
    corecore