DOCSLIB.ORG

Fuzzy Choice Functions, Consistency, and Sequential Fuzzy Choice

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Fuzzy Choice Functions, Consistency, and Sequential Fuzzy Choice 16th World Congress of the International Fuzzy Systems Association (IFSA) 9th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT) Fuzzy choice functions, consistency, and sequential fuzzy choice José Carlos R. Alcantud,1 S. Díaz2 1Facultad de Economía y Empresa and IME, University of Salamanca, 37007 Salamanca, Spain 2Dept. of Statistics and O. R., University of Oviedo, Calvo Sotelo s/n, 33007 Oviedo, Spain Abstract by this sequential procedure. This implies that the same is true for full-rationality (i.e., for the In the setting of fuzzy choice functions existence of a well-behaved fuzzy relation that G- (Georgescu [6]), we explore the relationships rationalizes the fuzzy choice). among known and new consistency axioms. Then Secondly, when the sequential application of we define the notion of sequential application of G-rational fuzzy choice functions produces a G- fuzzy choice functions, and investigate its nor- rational fuzzy choice function, the fuzzy preference mative implications. The Fuzzy Arrow Axiom that G-rationalizes their sequential application is is preserved by this sequential procedure, which identified. ensures that full-rationality is preserved too. This paper is structured as follows. In Section 2 we recall some preliminary definitions and concepts Keywords: Choice function, Fuzzy choice function, from the crisp literature. In Section 3 we introduce Fuzzy Arrow Axiom. the fuzzy set theory and discuss the connection be- tween some consistency conditions in this context. 1. Introduction In Section 4 we present the results obtained for se- quential choices. We conclude in Section 5. In the act of choice, rationality is a central issue that has raised many controversial analysis. There 2. The Crisp Case is a trend in the literature that considers choice as rational only when derives from well-behaved pref- The remote antecedent of our investigation is the erences. Transitivity of preference is the paradig- following model of abstract choice. matic rational principle to obey, and it is assumed The collection of all situations that a decision- by many descriptive theories of decision making. maker can conceivably face are represented by B, a However experimental evidence contradicts this po- nonempty domain of nonempty subsets of X. That sition, as recognized as soon as in May [9] and Tver- is, if P(X) denotes the set of all subsets of X then sky [12]. we require ∅ 6= B ⊆ P(X) and S 6= ∅ for all S ∈ B. Therefore other authors attempted to study the For convenience sometimes we drop brackets, e.g., object of choice –formally, choice functions– and dis- the set {x} can be represented as x. cuss which possible rationality properties could be Choices (among the subsets in B) are captured by tested without any reference to an underlying pref- the following notion: erence. As soon as in Uzawa [13] the term “rational choice function” means a choice function satisfying Definition 1 A decisive choice correspondence on axioms of rational behavior. Nevertheless the idea (X, B) is a map C : B → P(X) such that C(S) ⊆ S that these axioms can be used to test the model and C(S) 6= ∅ for all S ∈ B. by optimization of nice preferences with the observ- ables (the actual choices) is central in the analysis Henceforth we simply refer to decisive choice cor- of economic or abstract decisions (cf., Arrow [1] and respondences as choice functions. They attach with Sen [10] among others). each feasible set in the domain B, the set of alterna- If we recognize that social phenomena involve in- tives that are either potentially or actually chosen trinsically vague concepts then we can perform more by the decision-maker. extensive studies in the lines highlighted above. In Particular specifications of this abstract model this work we are interested in fuzzy choice functions call for suitably adapted terms. For example in as defined in Georgescu [6]. Economics, demand theory is concerned with de- We explore the relationships among known and mand functions or demand correspondences, whose new consistency axioms for this setting. Then we domain is constituted by budget sets. define the new concept of sequential fuzzy choice functions, and explore its normative implications. 2.1. Consistency properties Our main findings are two when the minimum t- norm is assumed. Firstly, a foremost consistency A good deal of the literature on choice functions is axiom known as Fuzzy Arrow Axiom is preserved devoted to study properties of choice that embody © 2015. The authors - Published by Atlantis Press 564 rationality in various forms and their relationships. the choice function can be rationalized through We proceed to list some rationality or consistency some specific procedure constitute another impor- properties of choice that we are interested in. tant branch in choice theory, especially in revealed The strongest version of the consistency axioms preference theory. These relationships and char- that we define is the crisp Arrow Axiom (AA), acterizations rely on the structure of the domain which demands that for any S, T ∈ B, the following of subsets for which choices are defined or known. implication holds: Particularly, we may be bound by the following con- straints: S ⊆ T ⇒ either S ∩ C(T ) = ∅ or S ∩ C(T ) = C(S) . Definition 3 Condition H is satisfied if B contains Other weaker properties used to capture rationality all non-empty finite subset of X. Condition WH in the context of crisp choice functions follow: is satisfied if B contains at least all the pairs and Definition 2 The choice function C satisfies: triplets of alternatives. • The Chernoff condition, also CH, if for any To grasp the importance of assumption H we re- S, T ∈ B such that S ⊆ T we have call that already Arrow [1] emphasized in his in- sightful analysis on the theory of consumer’s de- C(T ) ∩ S ⊆ C(S). mand: “the demand-function point of view would • The Superset property, also SUP, if for all be greatly simplified if the range over which the S, T ∈ B such that S ⊆ T it is the case that choice functions are considered to be determined is broadened to include all finite sets” and also: “re- C(T ) ⊆ C(S) ⇒ C(T ) = C(S) . quiring the choice functions to be defined for finite sets is thoroughly consistent with the intuitive ar- • Property γ (cf., Sen [10]), also γ, if for any guments underlying revealed preference. It should collection {M } of subsets of B the following i i∈I also be observed that any hope of using experimen- holds true: tal methods for studying preference will require in- x ∈ C(Mi) for all i ∈ I entails x ∈ C(∪i∈I Mi) . ferring from choices on finite sets to choices on in- finite ones.” Even under assumption WH, he shows This property is stronger than the Concor- among other issues that Samuelson’s weak axiom of dance property which only establishes that revealed preference is equivalent to the strong ax- C(S) ∩ C(T ) ⊆ C(S ∪ T ) throughout. iom of revealed preference and to Arrow’s Axiom. • The Binariness property, also B, if for any And that they are equivalent to the property that S ∈ B we have: x ∈ S and x ∈ C(x, y) for all the choice function is rationalizable in the most sat- y ∈ S implies x ∈ C(S). isfactory manner: there exists a complete and tran- sitive relation Q such that for each S ∈ B, C(S) is 2.2. Relationships among consistency the set of maximizers of R in S, this is, properties C(S) = {x ∈ S | (x, y) ∈ R for all y ∈ S} . In the crisp case there are implications among the properties in Subsection 2.1, which are represented 3. The Fuzzy Case: a Study in Consistency by Figure 1. Neither of them can be reversed. More- over, there is no connection among the properties on We now move forward to the fuzzy context. We the right, except for the ones shown between Prop- begin with the analysis of the issues that Section 2 erty γ and Binariness and Property γ and Concor- motivates. The main concept that we need to es- dance. tablish is the following (cf., Georgescu [6, Definition 5.13]): Chernoff condition Definition 4 Let X be a non-empty set and B a non empty set of non-zero fuzzy subsets of X. Superset property A fuzzy choice function on (X, B) is a mapping Arrow Axiom ⇒ Property γ ⇒ Binariness C : B → F(X) such that for each S ∈ B, C(S) is non-zero and C(S) ⊆ S, i.e., C(S)(x) ≤ S(x) for ⇓ all x ∈ X. Concordance S(x) is called the availability degree of the alter- native x in S or if S represents a vague criterion, Figure 1: Implications among consistency proper- it captures the degree to which x verifies the crite- ties of crisp choice functions. rion. Definition 4 includes the class of fuzzy choice functions originally studied by Banerjee [2]. The relationships among the consistency prop- In order to define consistency properties of fuzzy erties mentioned above and the possibility that choice functions, we first need to recall the concepts 565 that permit to use intersection, union, implications 3.1. Consistency of fuzzy choice functions: and inclusions in the fuzzy context. some new axioms The intersection of fuzzy sets is usually defined by Let X be a non-empty set and B a non empty set of the minimum t-norm, and we follow this tradition. non-zero fuzzy subsets of X. We proceed to define A t-norm is a binary operation ∗ on [0, 1] that is some known and new axioms of consistency for C, commutative, associative, monotone and has 1 as a fuzzy choice function on (X, B).
Load more

Recommended publications
  • Computing Degrees of Subsethood and Similarity for Interval-Valued Fuzzy Sets: Fast Algorithms Hung T
    University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Department of Computer Science 8-1-2008 Computing Degrees of Subsethood and Similarity for Interval-Valued Fuzzy Sets: Fast Algorithms Hung T. Nguyen Vladik Kreinovich University of Texas at El Paso, [email protected] Follow this and additional works at: http://digitalcommons.utep.edu/cs_techrep Part of the Computer Engineering Commons Comments: Technical Report: UTEP-CS-08-27a Published in Proceedings of the 9th International Conference on Intelligent Technologies InTech'08, Samui, Thailand, October 7-9, 2008, pp. 47-55. Recommended Citation Nguyen, Hung T. and Kreinovich, Vladik, "Computing Degrees of Subsethood and Similarity for Interval-Valued Fuzzy Sets: Fast Algorithms" (2008). Departmental Technical Reports (CS). Paper 94. http://digitalcommons.utep.edu/cs_techrep/94 This Article is brought to you for free and open access by the Department of Computer Science at DigitalCommons@UTEP. It has been accepted for inclusion in Departmental Technical Reports (CS) by an authorized administrator of DigitalCommons@UTEP. For more information, please contact [email protected]. Computing Degrees of Subsethood and Similarity for Interval-Valued Fuzzy Sets: Fast Algorithms Hung T. Nguyen Vladik Kreinovich Department of Mathematical Sciences Department of Computer Science New Mexico State University University of Texas at El Paso Las Cruces, NM 88003, USA El Paso, TX 79968, USA [email protected] [email protected] Abstract—Subsethood A ⊆ B and set equality A = B are Thus, for two fuzzy sets A and B, it is reasonable to define among the basic notions of set theory. For traditional (“crisp”) degree of subsethood and degree of similarity.
    [Show full text]
  • A Class of Fuzzy Theories*
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 85, 409-451 (1982) A Class of Fuzzy Theories* ERNEST G. MANES Department of Mathematics and Statistics, University of Massachusetts, Amherst, Massachusetts 01003 Submitted by L. Zadeh Contenfs. 0. Introduction. 1. Fuzzy theories. 2. Equality and degree of membership. 3. Distributions as operations. 4. Homomorphisms. 5. Independent joint distributions. 6. The logic of propositions. 7. Superposition. 8. The distributional conditional. 9. Conclusions. References. 0. INTR~DUCTTON At the level of syntax, a flowchart scheme [25, Chap. 41 decomposes into atomic pieces put together by the operations of structured programming [ 11. Our definition of “fuzzy theory” is motivated solely by providing the minimal machinery to interpret loop-free schemes in a fuzzy way. Indeed, a fuzzy theory T = (T, e, (-)“) is defined in Section 1 by the data (A, B, C). For each set X there is given a new set TX of “distributions on X” or “vague specifications (A) of elements of X.” For each set X there is given a distinguished function e, : X-+ TX, “a crisp 03) specification is a special case of a vague one.” For each “fuzzy function” a: X-, TY there is given a distinguished “extension” (Cl a#: TX-+ TY. The data are all subject to three axioms. This definition is motivated by the flowchart scheme l.E. Some fundamental examples are crisp set theory: TX = X, CD) fuzzy set theory: TX = [0, llx, (E) * The research reported in this paper was supported in part by the National Science Foun- dation under Grant MCS76-84477. 409 0022-247X/82/020409-43$02.0010 Copyright 0 1982 by Academic Press, Inc.
    [Show full text]
  • Appendix a Basic Concepts of Fuzzy Set Theory A.I Fuzzy Sets ILA{X): X
    Appendix A Basic Concepts of Fuzzy Set Theory This appendix gives the definitions of the concepts of fuzzy set theory, which are used in this book. For a comprehensive treatment of fuzzy set theory, see, for instance, (Zimmermann, 1996; Klir and Yuan, 1995). A.I Fuzzy Sets Definition A.I (fuzzy set) A fuzzy set A on universe (domain) X is defined by the membership function ILA{X) which is a mapping from the universe X into the unit interval: ILA{X): X -+ [0,1]. (A.l) F{X) denotes the set of all fuzzy sets on X. Fuzzy set theory allows for a partial membership of an element in a set. If the value of the membership function, called the membership degree (grade), equals one, x belongs completely to the fuzzy set. If it equals zero, x does not belong to the set. If the membership degree is between 0 and 1, x is a partial member of the fuzzy set. In the fuzzy set literature, the term crisp is often used to denote nonfuzzy quantities, e.g., a crisp number, a crisp set, etc. A.2 Membership Functions In a discrete set X = {Xi I i = 1,2, ... ,n}, a fuzzy set A may be defined by a list of ordered pairs: membership degree/set element: (A.2) or in the form of two related vectors: In continuous domains, fuzzy sets are defined analytically by their membership func­ tions. In this book, the following forms of membership functions are used: 228 FUZZY MODELING FOR CONTROL Trapezoidal membership function: x-a d-X) /-L(x;a,b,c,d)=max ( O,min(b_a,l'd_c) , (A4) where a, b, c and d are coordinates of the trapezoid apexes.
    [Show full text]
  • Fuzzy Sets, Fuzzy Logic and Their Applications • Michael Gr
    Fuzzy Sets, Fuzzy Logic and Their Applications • Michael Gr. Voskoglou • Michael Gr. Fuzzy Sets, Fuzzy Logic and Their Applications Edited by Michael Gr. Voskoglou Printed Edition of the Special Issue Published in Mathematics www.mdpi.com/journal/mathematics Fuzzy Sets, Fuzzy Logic and Their Applications Fuzzy Sets, Fuzzy Logic and Their Applications Special Issue Editor Michael Gr. Voskoglou MDPI • Basel • Beijing • Wuhan • Barcelona • Belgrade • Manchester • Tokyo • Cluj • Tianjin Special Issue Editor Michael Gr. Voskoglou Graduate Technological Educational Institute of Western Greece Greece Editorial Office MDPI St. Alban-Anlage 66 4052 Basel, Switzerland This is a reprint of articles from the Special Issue published online in the open access journal Mathematics (ISSN 2227-7390) (available at: https://www.mdpi.com/journal/mathematics/special issues/Fuzzy Sets). For citation purposes, cite each article independently as indicated on the article page online and as indicated below: LastName, A.A.; LastName, B.B.; LastName, C.C. Article Title. Journal Name Year, Article Number, Page Range. ISBN 978-3-03928-520-4 (Pbk) ISBN 978-3-03928-521-1 (PDF) c 2020 by the authors. Articles in this book are Open Access and distributed under the Creative Commons Attribution (CC BY) license, which allows users to download, copy and build upon published articles, as long as the author and publisher are properly credited, which ensures maximum dissemination and a wider impact of our publications. The book as a whole is distributed by MDPI under the terms and conditions of the Creative Commons license CC BY-NC-ND. Contents About the Special Issue Editor ...................................... vii Preface to ”Fuzzy Sets, Fuzzy Logic and Their Applications” ...................
    [Show full text]
  • Fuzzy Sets ( Type-1 and Type-2) and Their Applications
    Fuzzy Sets ( Type-1 and Type-2) and their Applications Presented by Prof. U. S. Tiwary, IIIT Allahabad (for self use only) Why Fuzzy Sets • It enables one to work in uncertain and ambiguous situations and solve ill-posed problems or problems with incomplete information Example : Fuzzy Image Processing (Humanlike) . Human visual system is perfectly adapted to handle uncertain information in both data and knowledge . It will be hard to define quantitatively how an object , such as a car, has to look in terms of geometrical primitives with exact shapes, dimensions and colors. We use descriptive language to define features that eventually are subject to a wide range of variations. 3 Fuzzy Reasoning and Probability • They are related , but complimentary to each other. • Say, for example , if we have to define the probability of appearance of an edge in few frames of images, we have to define, what is an edge. Certain threshold for rate of variation has to be taken, which may not be true for other images or noisy images. • Fuzzy logic, unlike probability, handles imperfection in the informational content of the event. 4 Two frameworks for Fuzzy Systems 1) Development based on Crisp mathematical model and fuzzifying some quantities : Model 1 : Fuzzy Mathematical Model Example : Fuzzy – K means clustering 2) Development based on Fuzzy Inference rules: Model 2 : Fuzzy Logical Model Example : Fuzzy decision Support System 1. Definition of fuzzy set • 1.1 Concept for fuzzy set – Definition (Membership function of fuzzy set) In fuzzy sets, each elements is mapped to [0,1] by membership function. A : X [0, 1] Where [0,1] means real numbers between 0 and 1 (including 0 and 1).
    [Show full text]
  • Comparison and Links Between Two 2-Tuple Linguistic Models for Decision Making Isis Truck
    Comparison and links between two 2-tuple linguistic models for decision making Isis Truck To cite this version: Isis Truck. Comparison and links between two 2-tuple linguistic models for decision making. Knowledge-Based Systems, Elsevier, 2015, Computational Intelligence Applications for Data Science, 87, pp.61-68. 10.1016/j.knosys.2015.05.030. hal-01187994 HAL Id: hal-01187994 https://hal.archives-ouvertes.fr/hal-01187994 Submitted on 28 Aug 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Comparison and links between two 2-tuple linguistic models for decision making Isis Truck∗ CHArt-EA4004 Laboratory University Paris 8 2 rue de la Libert´e 93526 Saint-Denis (FRANCE) Abstract This paper deals with linguistic models that may prove useful for representing the information during decision making. Data extraction is a complex problem, especially when dealing with infor- mation coming from human beings (linguistic assertions, preferences, feelings, etc.) and several models have emerged to overcome difficulties in expressing the data. Among those models, we are interested in two of them: the 2-tuple semantic model and the 2-tuple symbolic model. In this paper we stress on a comparison between both models and we prove that links can be made between them.
    [Show full text]
  • Every Set Has at Least Three Choice Functions
    Mathematica Moravica Vol. 13 -2 (2009), 103–116 Every Set Has at Least Three Choice Functions Milan R. Tasković Abstract. This paper continues the study of the Axiom of Choice by E. Z e r m e l o [Neuer Beweis für die Möglichkeit einer Wohlordung, Math. Annalen, 65 (1908), 107–128; translated in van Heijenoort 1967, 183–198]. We prove some new equivalents of the Axiom of Choice, i.e., Zorn’s lemma, and in connection with an initial equivalent also fact that every set has at least three choice functions. 1. History and annotations We shall first discuss an assumption that appears to be independent of, and yet consistent with, the usual logical assumptions regarding classes and correspondences, but whose absolute validity has been seriously questioned by many authors. This is the so-called Axiom of Choice, which has excited more controversy than any other axiom of set theory since its formulation by Ernst Zermelo in 1908. In this sense, many results are known in the set theory. In 1904, Zermelo1 stated a principle of choice similar to: If D is a family of nonempty sets, there is a function f such that f(A) ∈ A for every A ∈ D; and proved that it implied the well-ordering theorem. In 1908 Zermelo pro- posed main version of the Axiom of Choice. This is the connection and with a conversations with Erhardt Schmidt. Bertrand Russell in 1906 gave a principle analogous to preceding. He an- nounced this principle as a possible substitute for Zermelo’s but he believed that it was weaker.
    [Show full text]
  • A Fuzzy-Set Approach to Treat Determinacy and Consistency of Linguistic Terms in Multi-Criteria Decision Making Q
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector International Journal of Approximate Reasoning 44 (2007) 165–181 www.elsevier.com/locate/ijar A fuzzy-set approach to treat determinacy and consistency of linguistic terms in multi-criteria decision making q J. Ma a,d,*, D. Ruan b,c,Y.Xua, G. Zhang d a Department of Mathematics, Southwest Jiaotong University, Chengdu 610031, PR China b Belgian Nuclear Research Centre (SCK-CEN), Boeretang 200, Mol 2400, Belgium c Department of Mathematics and Computer Science, Ghent University, Krijgslaan 281 (S9), Gent 9000, Belgium d Faculty of Information Technology, University of Technology, Sydney, P.O. Box 123, Broadway, NSW 2007, Australia Received 28 August 2005; received in revised form 16 June 2006; accepted 18 July 2006 Available online 18 August 2006 Abstract A fuzzy-set-based approach is presented to describe linguistic information in multi-criteria deci- sion making. After having introduced concepts of determinacy and consistency of linguistic terms, the understandable degree and consistence degree of linguistic terms are illustrated by these two con- cepts. A case study is demonstrated for the proposed decision-making model with an analytical con- clusion of both advantages and disadvantages. Ó 2006 Elsevier Inc. All rights reserved. Keywords: Multi-criteria decision making; Linguistic terms; Fuzzy sets; Determinacy of linguistic terms; Consistency of linguistic terms q This work is partly supported by the National Natural Science Foundation of China with Grant Number 60474022, China-Flanders Bilateral Scientific Cooperation Joint Project proposal with Grant Number 011S1105, and the Australia Research Council (ARC) under discovery grant DP0559123.
    [Show full text]
  • A Development of Set Theory in Fuzzy Logic
    A Development of Set Theory in Fuzzy Logic Petr Hajek and Zuzana Hanikova Institute of Computer Science Praha Czech Republic Abstract This pap er presents an axiomatic set theory FST Fuzzy Set Theory as a rstorder theory within the framework of fuzzy logic in the style of In the classical ZFC we use a construction similar to that of a Bo oleanvalued universeover an algebra of truth values of the logic we useto show the nontriviali ty of FST We give the axioms of FST Finally we show that FST interprets ZF Intro duction If anything comes to p eoples minds on the term fuzzy set theory b eing used it usually is the theory or theories handling fuzzy sets as realvalued functions on a xed universe within the classical settheoretic universe However as fuzzy or manyvalued logic has b een evolving into a formal axiomatic theory a few exceptions from this general exp ectation have emerged these are formal set theories within the resp ective manyvalued logics ie theories whose underlying logic is governed by a manyvalued semantics We rely esp ecially on those works which develop a theory in the language and style of the classical ZermeloFraenkel set theory ZF We have b een inspired by a series of pap ers developing a theory generalizing ZF in a formally weaker logicintuitionistic and later its strengthening commonly referred to as Godel logic some results and pro ofs carry over to our system For an imp ortant example the axiom of foundation together with a very weak fragment of ZF implies the law of the excluded middle which yields the
    [Show full text]
  • Analysis of Decision Support System Based on 2-Tuple Spherical Fuzzy Linguistic Aggregation Information
    applied sciences Article Analysis of Decision Support System Based on 2-Tuple Spherical Fuzzy Linguistic Aggregation Information Saleem Abdullah 1,* , Omar Barukab 2, Muhammad Qiyas 1 , Muhammad Arif 1 and Sher Afzal Khan 1 1 Faculty of Physical and Numerical Sciences, Abdul Wali Khan University Mardan, Mardan 23200, Pakistan; [email protected] (M.Q.); [email protected] (M.A.); [email protected] (S.A.K.) 2 Faculty of Computing and Information Technology, King Abdulaziz University, P.O. Box 411, Rabigh 21911, Jeddah, Saudi Arabia; [email protected] * Correspondence: [email protected] Received: 27 October 2019; Accepted: 10 December 2019; Published: 30 December 2019 Abstract: The aim of this paper is to propose the 2-tuple spherical fuzzy linguistic aggregation operators and a decision-making approach to deal with uncertainties in the form of 2-tuple spherical fuzzy linguistic sets. 2-tuple spherical fuzzy linguistic operators have more flexibility than general fuzzy set. We proposed a numbers of aggregation operators, namely 2-tuple spherical fuzzy linguistic weighted average, 2-tuple spherical fuzzy linguistic ordered weighted average, 2-tuple spherical fuzzy linguistic hybrid average, 2-tuple spherical fuzzy linguistic weighted geometric, 2-tuple spherical fuzzy linguistic ordered geometric, and 2-tuple spherical fuzzy linguistic hybrid geometric operators. The distinguishing feature of these proposed operators is studied. At that point, we have used these operators to design a model to deal with multiple attribute decision-making issues under the 2-tuple spherical fuzzy linguistic information. Then, a practical application for best company selection for feeds is given to prove the introduced technique and to show its practicability and effectiveness.
    [Show full text]
  • Fuzzy Functions and Their Applications
    Journal of Mathematical Analysis and Applications 252, 495᎐517Ž. 2000 doi:10.1006rjmaa.2000.7185, available online at http:rrwww.idealibrary.com on Fuzzy Functions and Their Applications Mustafa Demirci Akdeniz Uni¨ersity, Department of Mathematics, 07058 Antalya, Turkey E-mail: [email protected] View metadata, citation and similar papers at core.ac.uk brought to you by CORE Submitted by Ulrich Hohle¨ provided by Elsevier - Publisher Connector Received February 7, 2000 1. INTRODUCTION The concept of fuzzy equalitywx 7 , which is also called the equality relationwx 10, 14 , the fuzzy equivalence relation wx 12 , the similarity relation wx6, 17, 21 , the indistinguishability operator wx 18, 19 , and the fuzzy functions based on fuzzy equalities, has a significant concern in various fieldsw 1, 2, 7, 8, 14x . The fuzzy functions and fuzzy equalities had been successfully applied in the category theoretical framewx 1, 6, 7, 9 and fuzzy control w 10, 13x . Vagueness on equality of points is mainly associated with Poincare’s´ paradox on physical continuumwx 7, 9, 11 , and it is shown as an example of Poincare’s paradox the ignorance of two very near numbers representing an attribute of a thing, for example, the temperature of weather, the cost of a car, the mass of a particle, etc., as the same number leads us some physical paradoxical situationswx 11 . The concept of fuzzy equality proves a useful mathematical tool to avoid Poincare-like´ paradoxeswx 7 . In this paper, adopting a slightly modified definition of the equality
    [Show full text]
  • A Note on Subsethood Measure of Fuzzy Sets
    International Journal of Energy, Information and Communications Vol. 3, Issue 3, August, 2012 A Note on Subsethood Measure of Fuzzy Sets Mamoni Dhar Assistant Professor, Department Of Mathematics Science College, Kokrajhar-783370, Assam, India [email protected], [email protected] Abstract The main aim of this article is to revisit the definitions of subsethood measure which are predomonant in the literature of fuzzy set theory. It is also intended to revisit the relationship between fuzzy entropy and conditioning as proposed by some authors. We wish to analyze these with the extended definition of complementation of fuzzy sets on the basis of reference function. The existing definition of cardinality of fuzzy sets should have to be changed accordingly and a new definition is proposed hereby. Here efforts have been made to show that those proposed definitions of subsethood measure are not acceptable. Again due to the same reason we would like to mention here that the entropy-subsethood relationship which had been introduced by some authors is also not logical. Keywords: fuzzy membership value, fuzzy membership function, superimposition of sets, Shannon’s indices 1. Introduction Subsethood measure is an important concept of fuzzy set theory. In the literature, there are several well known measures of subsethood. It stands for the degree that a given fuzzy set B is a subset of another set A. Many contributions on the measure of the degree of subsethood between two fuzzy sets have already been made. But most commonly used measure of subsethood is the one proposed by Kosko [2]. The fuzzy subsethood theorem was derived both algebraically and geometrically by Kosko who designated it the fundamental unifying structure in fuzzy set theory.
    [Show full text]