Analyzing the correspondence between non-strict and strict outranking relations
|
|
- Duane Lewis
- 5 years ago
- Views:
Transcription
1 Analyzing the correspondence between non-strict and strict outranking relations Denis Bouyssou Marc Pirlot CNRS Paris, France FPMs Mons, Belgium ROADEF, Toulouse, 2010
2 2 Introduction Outranking relations Concordance / non-discordance alternative x is preferable to alternative y if concordance condition the coalition of attributes supporting this assertion is more important than the coalition of attributes opposing it non-discordance condition there is no attribute that strongly opposes this assertion ELECTRE preferable means at least as good as TACTIC preferable means strictly better than
3 5 Framework Definitions and notation Setting Classical conjoint measurement setting N = {1, 2,..., n}: set of attributes X = n i=1 X i with n 2: set of alternatives x = (x 1, x 2,..., x n ) X S reflexive binary relation on X interpreted as an at least as good as relation between alternatives
4 6 Definitions and notation Reflexive Concordance relations Definition of reflexive concordance relations Reflexive Concordance Relations (RCR) with S(x, y) = {i N : x i S i y i } and x S y S(x, y) S(y, x) S i : complete binary relation X i : binary relation between subsets of attributes having N for union that is increasing w.r.t. inclusion and such that N N A B, C A and B D C D S i : preference relation on attribute i N asymmetric part of S i: S a i symmetric part of S i: S s i : importance relation between coalitions of attributes because S i is complete, S(x, y) S(y, x) = N, for all x, y X
5 7 Definitions and notation Outranking relations Definition of reflexive outranking relations Reflexive Outranking Relations (ROR) x S y [S(x, y) S(y, x) and V (y, x) = ] with S(x, y) = {i N : x i S i y i } and V (y, x) = {i N : y i V i x i } S i : complete binary relation X i V i : binary relation on X i such that V i S a i : binary relation between subsets of attributes having N for union that is increasing w.r.t. inclusion A B, C A and B D C D V i : far better than relation on attribute i N
6 8 ELECTRE I Definitions and notation Examples ELECTRE I with: x S y s [0.5, 1]: concordance threshold i S(x,y) w i j N w j and V (y, x) = s S i : semi order (complete, Ferrers and semitransitive) V i Si a : strict semiorder (asymmetric, Ferrers and semitransitive)
7 10 Axiomatic analysis Model Conjoint measurement framework Model (M) x S y F (p 1 (x 1, y 1 ), p 2 (x 2, y 2 ),..., p n (x n, y n )) 0 with p i skew symmetric (p i (x i, y i ) = p i (y i, x i )) F nondecreasing in all its arguments F (0) 0 (M) Interpretation p i measures preference differences between levels on attribute i N F synthesizes these preference differences
8 11 Axiomatic analysis Axiomatic analysis Results Model (M) RCR ROR two conditions guaranteeing that preference differences on each attribute are well behaved axioms for model (M) two additional axioms guaranteeing that each p i takes at most three distinct values: +k i, 0, k i upper coarseness, lower coarseness axioms for model (M) two additional axioms guaranteeing that each p i takes at most five distinct values: +v i, +k i, 0, k i, v i upper coarseness, weak lower coarseness
9 13 Extensions Asymmetric outranking relations Asymmetric outranking relations same principles, except that preferable means strictly preferred instead of at least as good as TACTIC, Vansnick, 1986 w i > i P(x,y) x P y and W (y, x) = with: P(x, y) = {i N : x i P i y i } ε 0: threshold j P(y,x) w j + ε P i : strict semi order (asymmetric, Ferrers and semitransitive) W i P i : strict semiorder (asymmetric, Ferrers and semitransitive)
10 14 Extensions Asymmetric outranking relations Definition of asymmetric concordance relations Asymmetric Concordance relations (ACR) with P(x, y) = {i N : x i P i y i } and x P y P(x, y) P(y, x) P i : asymmetric binary relation X i : binary relation between disjoint subsets of attributes that is increasing w.r.t. inclusion and such that Not[ ] A B, C A and B D C D
11 15 Coduality Extensions Asymmetric outranking relations Coduality T is a binary relation on A a T cd b Not[ b T a ] RCR and ACR complete RCR and ACR correspond through coduality
12 16 Coduality Extensions Asymmetric outranking relations x P y P(x, y) P(y, x) P i cd = S i (S i is complete) A B Not[ N \ B N \ A ] Not[ y P x ] Not[ P(x, y) P(y, x) ] Not[ N \ S(y, x) N \ S(x, y) ] S(x, y) S(y, x) x S y S codual of P is complete conversely the codual of the completion of a RCR is an ACR
13 17 Extensions Asymmetric outranking relations Definition of asymmetric outranking relations Asymmetric Outranking Relations (AOR) x P y [P(x, y) P(y, x) and W (y, x) = ] with P(x, y) = {i N : x i P i y i } and and W (y, x) = {i N : y i W i x i } P i : asymmetric binary relation X i W i : binary relation on X i such that W i P i : binary relation between disjoint subsets of attributes that is increasing w.r.t. inclusion and such that Not[ ] A B, C A and B D C D
14 18 Results Extensions Asymmetric outranking relations Not[ y P x ] Not[ P(x, y) P(y, x) and W (x, y) = ] Not[ N \ S(y, x) N \ S(x, y) ] or W (x, y) S(x, y) S(y, x) or W (x, y) Outranking relations with bonus x S y S(x, y) S(y, x) or W (x, y) we have a characterization of AOR we have a characterization of outranking relations with bonus through coduality
15 Extensions Asymmetric part of a ROR Asymmetric part of a ROR x S a y [x S y and Not[ y S x ] [S(x, y) S(y, x) and V (y, x) = ] and [Not[ S(y, x) S(x, y) ] or V (x, y) ] x c y iff S(x, y) S(y, x) x c y and V (y, x) = x S a y or x c y, V (y, x) = and V (x, y). 19 double rôle of the veto relation: veto and bonus is used in some outranking methods (ELECTRE TRI) is not an AOR is not an ROR an axiomatic characterization is available
16 References Bouyssou, D., Pirlot, M. (2005) A characterization of concordance relations. European Journal of Operational Research, 167, , Bouyssou, D., Pirlot, M. (2008) An axiomatic approach to TACTIC. Cahier du LAMSADE 238, Bouyssou, D., Pirlot, M. (2007) Further results on concordance relations. European Journal of Operational Research, 181, , Bouyssou, D., Pirlot, M. (2009) An axiomatic analysis of concordance-discordance relations. European Journal of Operational Research, 199, 468-Ű477, 2009.
An axiomatic analysis of concordance-discordance relations
An axiomatic analysis of concordance-discordance relations Denis Bouyssou, Marc Pirlot To cite this version: Denis Bouyssou, Marc Pirlot. An axiomatic analysis of concordance-discordance relations. 2007.
More informationA note on the asymmetric part of an outranking relation
A note on the asymmetric part of an outranking relation Denis Bouyssou 1 Marc Pirlot 2 19 March 2014 Abstract This note discusses the properties of the asymmetric part of an outranking relation à la ELECTRE.
More informationMultiattribute preference models with reference points
Multiattribute preference models with reference points Denis Bouyssou a,b, Thierry Marchant c a CNRS, LAMSADE, UMR 7243, F-75775 Paris Cedex 16, France b Université Paris Dauphine, F-75775 Paris Cedex
More informationAn axiomatic approach to ELECTRE TRI 1
An axiomatic approach to ELECTRE TRI 1 Denis Bouyssou 2 CNRS LAMSADE Thierry Marchant 3 Ghent University 22 April 2004 Prepared for the Brest Proceedings Revised following the comments by Thierry 1 This
More informationAn axiomatic approach to TACTIC
An axiomatic approach to TACTIC Denis Bouyssou * Marc Pirlot ** * CNRS LAMSADE UMR 7243 & Université Paris Dauphine Place du Maréchal de Lattre de Tassigny, F-75775 Paris Cedex 16, France bouyssou@lamsade.dauphine.fr
More informationAn axiomatic approach to noncompensatory sorting methods in MCDM II : More than two categories
An axiomatic approach to noncompensatory sorting methods in MCDM II : More than two categories Denis Bouyssou, Thierry Marchant To cite this version: Denis Bouyssou, Thierry Marchant. An axiomatic approach
More informationCAHIER DU LAMSADE 229
Laboratoire d'analyse et Modélisation de Systèmes pour l'aide à la Décision CNRS UMR 7024 CAHIER DU LAMSADE 229 Juin 2005 An axiomatic approach to noncompensatory sorting methods in MCDM I : The case of
More informationConjoint Measurement without Additivity and Transitivity
Conjoint Measurement without Additivity and Transitivity Denis Bouyssou LAMSADE - Paris - France Marc Pirlot FacultŽ Polytechnique de Mons - Mons - Belgium Conjoint Measurement without Additivity and Transitivity
More informationConjoint Measurement Models for Preference Relations
Chapter 16 Conjoint Measurement Models for Preference Relations 16.1. Introduction Conjoint measurement [KRA 71, WAK 89] is concerned with the study of binary relations defined on Cartesian products of
More informationOn some ordinal models for decision making under uncertainty
On some ordinal models for decision making under uncertainty Denis Bouyssou, Marc Pirlot Abstract In the field of Artificial Intelligence many models for decision making under uncertainty have been proposed
More informationNumerical representations of binary relations with thresholds: A brief survey 1
Numerical representations of binary relations with thresholds: A brief survey 1 Fuad Aleskerov Denis Bouyssou Bernard Monjardet 11 July 2006, Revised 8 January 2007 Typos corrected 1 March 2008 Additional
More informationReference-based Preferences Aggregation Procedures in Multicriteria Decision Making
Reference-based Preferences Aggregation Procedures in Multicriteria Decision Making Antoine Rolland Laboratoire ERIC - Université Lumière Lyon 2 5 avenue Pierre Mendes-France F-69676 BRON Cedex - FRANCE
More informationValued relations aggregation with the Borda method.
Valued relations aggregation with the Borda method. Thierry Marchant* Service de mathématiques de la gestion, Université Libre de Bruxelles, Boulevard du Triomphe CP210-01, 1050 Bruxelles, Belgium. Tél
More informationFollowing the traces
Following the traces An introduction to conjoint measurement without transitivity and additivity Denis Bouyssou 1, CNRS, LAMSADE, Université Paris Dauphine, Place du Maréchal de Lattre de Tassigny, F-75775
More informationOn the relations between ELECTRE TRI-B and ELECTRE TRI-C and on a new variant of ELECTRE TRI-B
On the relations between ELECTRE TRI-B and ELECTRE TRI-C and on a new variant of ELECTRE TRI-B Denis Bouyssou, Thierry Marchant To cite this version: Denis Bouyssou, Thierry Marchant. On the relations
More informationNontransitive Decomposable Conjoint Measurement 1
Nontransitive Decomposable Conjoint Measurement 1 D. Bouyssou 2 CNRS LAMSADE M. Pirlot 3 Faculté Polytechnique de Mons Revised 16 January 2002 Forthcoming in Journal of Mathematical Psychology 1 We wish
More informationWho wins the election? Polarizing outranking relations with large performance differences. Condorcet s Approach. Condorcet s method
Who wins the election? Polarizing outranking relations with large performance differences Raymond Bisdorff Université du Luxembourg FSTC/ILAS ORBEL 26, Bruxelles, February 2012 Working hypothesis: 1. Each
More informationThe Polyhedron of all Representations of a Semiorder
The Polyhedron of all Representations of a Semiorder Barry Balof, Jean-Paul Doignon, Samuel Fiorini Abstract In many practical situations, indifference is intransitive. This led Luce (1956) to base a preference
More informationOutranking relations: Do they have special properties? 1 Denis Bouyssou
Outranking relations: Do they have special properties? 1 Denis Bouyssou Outranking relations are most often built using a concordance-discordance principle. Such relations are, in general, neither transitive
More informationELECTRE TRI-C: A Multiple Criteria Sorting Method Based on Central Reference Actions
ELECTRE TRI-C: A Multiple Criteria Sorting Method Based on Central Reference Actions Juscelino ALMEIDA DIAS 12, José Rui FIGUEIRA 12, Bernard ROY 1 1 LAMSADE, Université Paris-Dauphine, France 2 CEG-IST,
More informationOrdered categories and additive conjoint measurement on connected sets
Ordered categories and additive conjoint measurement on connected sets D. Bouyssou a, T. Marchant b a CNRS - LAMSADE, Université Paris Dauphine, F-75775 Paris Cedex 16, France b Ghent University, Dunantlaan
More informationELECTRE METHODS (PART I)
(PART I) José Rui FIGUEIRA (figueira@ist.utl.pt) Technical University of Lisbon 10th MCDM Summer School, Paris, France Contents 1 2 Main references for this talk: 1 Figueira, J., B. Roy, and V. Mousseau
More informationAdvanced Microeconomics Note 1: Preference and choice
Advanced Microeconomics Note 1: Preference and choice Xiang Han (SUFE) Fall 2017 Advanced microeconomics Note 1: Preference and choice Fall 2017 1 / 17 Introduction Individual decision making Suppose that
More informationA characterization of the 2-additive Choquet integral
A characterization of the 2-additive Choquet integral Brice Mayag Thales R & T University of Paris I brice.mayag@thalesgroup.com Michel Grabisch University of Paris I Centre d Economie de la Sorbonne 106-112
More informationThe possible and the necessary for multiple criteria group decision
The possible and the necessary for multiple criteria group decision Salvatore Greco 1, Vincent Mousseau 2 and Roman S lowiński 3 1 Faculty of Economics, University of Catania, Italy, salgreco@unict.it,
More informationConjoint measurement
Conjoint measurement A brief introduction Denis Bouyssou CNRS LAMSADE Paris, France MCDM Summer School École Centrale 2010 Typical problem Motivation Comparing holiday packages cost # of days travel time
More informationListing the families of Sufficient Coalitions of criteria involved in Sorting procedures
Listing the families of Sufficient Coalitions of criteria involved in Sorting procedures Eda Ersek Uyanık 1, Olivier Sobrie 1,2, Vincent Mousseau 2, Marc Pirlot 1 (1) Université de Mons (2) École Centrale
More informationDecisions with multiple attributes
Decisions with multiple attributes A brief introduction Denis Bouyssou CNRS LAMSADE Paris, France JFRO December 2006 Introduction Aims mainly pedagogical present elements of the classical theory position
More informationA conjoint measurement approach to the discrete Sugeno integral
A conjoint measurement approach to the discrete Sugeno integral A note on a result of Greco, Matarazzo and S lowiński Denis Bouyssou 1 CNRS LAMSADE Thierry Marchant 2 Ghent University Marc Pirlot 3 Faculté
More informationOn measuring and testing the ordinal correlation between valued outranking relations
On measuring and testing the ordinal correlation between valued outranking relations Raymond Bisdorff University of Luxembourg, FSTC/CSC/ILIAS raymond.bisdorff@uni.lu Abstract. We generalize Kendall s
More informationRelations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3)
Relations, Functions, Binary Relations (Chapter 1, Sections 1.2, 1.3) CmSc 365 Theory of Computation 1. Relations Definition: Let A and B be two sets. A relation R from A to B is any set of ordered pairs
More informationAxiomatic Decision Theory
Decision Theory Decision theory is about making choices It has a normative aspect what rational people should do... and a descriptive aspect what people do do Not surprisingly, it s been studied by economists,
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationMath 564 Homework 1. Solutions.
Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties
More informationThus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a
Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:
More informationChapter 1 - Preference and choice
http://selod.ensae.net/m1 Paris School of Economics (selod@ens.fr) September 27, 2007 Notations Consider an individual (agent) facing a choice set X. Definition (Choice set, "Consumption set") X is a set
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationOn tolerant or intolerant character of interacting criteria in aggregation by the Choquet integral
On tolerant or intolerant character of interacting criteria in aggregation by the Choquet integral Jean-Luc Marichal Department of Mathematics, Brigham Young University 292 TMCB, Provo, Utah 84602, U.S.A.
More informationStatic Decision Theory Under Certainty
Static Decision Theory Under Certainty Larry Blume September 22, 2010 1 basics A set of objects X An individual is asked to express preferences among the objects, or to make choices from subsets of X.
More informationJournal of Mathematical Psychology
Journal of Mathematical Psychology 86 (2018) 30 40 Contents lists available at ScienceDirect Journal of Mathematical Psychology journal homepage: www.elsevier.com/locate/jmp Expected Scott Suppes utility
More informationCAHIER DU LAMSADE 275
Laboratoire d'analyse et Modélisation de Systèmes pour l'aide à la Décision CNRS UMR 7024 CAHIER DU LAMSADE 275 Mai 2008 Additive and decomposable conjoint measurement with ordered categories Denis Bouyssou,
More informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationBinary relations and preference modelling
Binary relations and preference modelling Denis Bouyssou 1 CNRS LAMSADE Philippe Vincke 2 Université Libre de Bruxelles 16 December 2007 1 CNRS LAMSADE, Université Paris Dauphine, Place du Maréchal de
More informationFuzzy Sets. Mirko Navara navara/fl/fset printe.pdf February 28, 2019
The notion of fuzzy set. Minimum about classical) sets Fuzzy ets Mirko Navara http://cmp.felk.cvut.cz/ navara/fl/fset printe.pdf February 8, 09 To aviod problems of the set theory, we restrict ourselves
More informationAN INTRODUCTION TO SEPARATION LOGIC. 2. Assertions
AN INTRODUCTION TO SEPARATION LOGIC 2. Assertions John C. Reynolds Carnegie Mellon University January 7, 2011 c 2011 John C. Reynolds Pure Assertions An assertion p is pure iff, for all stores s and all
More informationA BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox
A BRIEF INTRODUCTION TO ZFC CHRISTOPHER WILSON Abstract. We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular
More informationOn the Chacteristic Numbers of Voting Games
On the Chacteristic Numbers of Voting Games MATHIEU MARTIN THEMA, Departments of Economics Université de Cergy Pontoise, 33 Boulevard du Port, 95011 Cergy Pontoise cedex, France. e-mail: mathieu.martin@eco.u-cergy.fr
More information1.3. The Completeness Axiom.
13 The Completeness Axiom 1 13 The Completeness Axiom Note In this section we give the final Axiom in the definition of the real numbers, R So far, the 8 axioms we have yield an ordered field We have seen
More informationPREFERENCES AGGREGATION & DECISION THEORY A. ROLLAND, UNIVERSITE LUMIERE LYON II
PREFERENCES AGGREGATION & DECISION THEORY A. ROLLAND, UNIVERSITE LUMIERE LYON II 2013 PLAN 1 Introduction & (Feb-05) 2 Preferences Aggregation : utility theory (Feb-15) 3 Preferences Aggregation : decision
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationUsing the Kappalab R package for capacity identification in Choquet integral based MAUT
Using the Kappalab R package for capacity identification in Choquet integral based MAUT Michel Grabisch Université de Paris I, LIP6 8 rue du Capitaine Scott 75015 Paris, France michel.grabisch@lip6.fr
More informationQuasi-Lovász extensions on bounded chains
Quasi-Lovász extensions on bounded chains Miguel Couceiro and Jean-Luc Marichal 1 LAMSADE - CNRS, Université Paris-Dauphine Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16, France miguel.couceiro@dauphine.fr
More informationWell-Ordered Sets, Ordinals and Cardinals Ali Nesin 1 July 2001
Well-Ordered Sets, Ordinals and Cardinals Ali Nesin 1 July 2001 Definitions. A set together with a binary relation < is called a partially ordered set (poset in short) if x (x < x) x y z ((x < y y < z)
More informationPreference and Utility
Preference and Utility Econ 2100 Fall 2017 Lecture 3, 5 September Problem Set 1 is due in Kelly s mailbox by 5pm today Outline 1 Existence of Utility Functions 2 Continuous Preferences 3 Debreu s Representation
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationElectre Methods: Main Features and Recent Developments
Electre Methods: Main Features and Recent Developments José Figueira, Salvatore Greco, Bernard Roy, Roman Slowinski To cite this version: José Figueira, Salvatore Greco, Bernard Roy, Roman Slowinski. Electre
More informationRelations and Equivalence Relations
Relations and Equivalence Relations In this section, we shall introduce a formal definition for the notion of a relation on a set. This is something we often take for granted in elementary algebra courses,
More informationCONJOINT MEASUREMENT TOOLS FOR MCDM A brief introduction
Chapter 1 CONJOINT MEASUREMENT TOOLS FOR MCDM A brief introduction Denis Bouyssou CNRS LAMSADE, Université Paris Dauphine F-75775 Paris Cedex 16 France bouyssou@lamsade.dauphine.fr Marc Pirlot Faculté
More informationAnalysis of additive generators of fuzzy operations represented by rational functions
Journal of Physics: Conference Series PAPER OPEN ACCESS Analysis of additive generators of fuzzy operations represented by rational functions To cite this article: T M Ledeneva 018 J. Phys.: Conf. Ser.
More informationChapter 1 PREFERENCE MODELLING
Chapter 1 PREFERENCE MODELLING Meltem Öztürk, Alexis Tsoukiàs LAMSADE-CNRS, Université Paris Dauphine, 75775 Paris Cedex 16, France {ozturk,tsoukias}@lamsade.dauphine.fr Philippe Vincke Université Libre
More informationAn axiomatic characterization of the prudent order preference function
An axiomatic characterization of the prudent order preference function Claude Lamboray Abstract In this paper, we are interested in a preference function that associates to a profile of linear orders the
More informationArrow s General (Im)Possibility Theorem
Division of the Humanities and ocial ciences Arrow s General (Im)Possibility Theorem KC Border Winter 2002 Let X be a nonempty set of social alternatives and let P denote the set of preference relations
More informationhal , version 1-21 Oct 2009
ON SKOLEMISING ZERMELO S SET THEORY ALEXANDRE MIQUEL Abstract. We give a Skolemised presentation of Zermelo s set theory (with notations for comprehension, powerset, etc.) and show that this presentation
More informationarxiv: v1 [math.gr] 25 Sep 2017
arxiv:1709.08538v1 [math.gr] 25 Sep 2017 Note on residual finiteness of Artin groups RUBÉN BLASCO GARCÍA ARYE JUHÁSZ LUIS PARIS Let A be an Artin group. A partition P of the set of standard generators
More information{x : P (x)} P (x) = x is a cat
1. Sets, relations and functions. 1.1. Set theory. We assume the reader is familiar with elementary set theory as it is used in mathematics today. Nonetheless, we shall now give a careful treatment of
More informationWeak Choice Principles and Forcing Axioms
Weak Choice Principles and Forcing Axioms Elizabeth Lauri 1 Introduction Faculty Mentor: David Fernandez Breton Forcing is a technique that was discovered by Cohen in the mid 20th century, and it is particularly
More informationCS156: The Calculus of Computation
Page 1 of 31 CS156: The Calculus of Computation Zohar Manna Winter 2010 Chapter 3: First-Order Theories Page 2 of 31 First-Order Theories I First-order theory T consists of Signature Σ T - set of constant,
More informationRobust ordinal regression for outranking methods
Outline Robust ordinal regression for outranking methods Salvatore Greco 1 Miłosz Kadziński 2 Vincent Mousseau 3 Roman Słowiński 2 1 Faculty of Economics, University of Catania, Italy 2 Institute of Computing
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
More informationAdvances in the Use of MCDA Methods in Decision-Making
Advances in the Use of MCDA Methods in Decision-Making JOSÉ RUI FIGUEIRA CEG-IST, Center for Management Studies, Instituto Superior Técnico, Lisbon LAMSADE, Université Paris-Dauphine (E-mail : figueira@ist.utl.pt)
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationTHREE AXIOM SYSTEMS FOR ADDITIVE SEMIORDERED STRUCTURES*
SIAM J. APPL. MATH. Vol. 25, No. 1, July 1973 THREE AXIOM SYSTEMS FOR ADDITIVE SEMIORDERED STRUCTURES* R. DUNCAN LUCEi Abstract. Axioms are provided for extensive, probability, and (two-component, additive)
More informationAxioms for the Real Number System
Axioms for the Real Number System Math 361 Fall 2003 Page 1 of 9 The Real Number System The real number system consists of four parts: 1. A set (R). We will call the elements of this set real numbers,
More informationOn minimal models of the Region Connection Calculus
Fundamenta Informaticae 69 (2006) 1 20 1 IOS Press On minimal models of the Region Connection Calculus Lirong Xia State Key Laboratory of Intelligent Technology and Systems Department of Computer Science
More informationLECTURE 3 Functional spaces on manifolds
LECTURE 3 Functional spaces on manifolds The aim of this section is to introduce Sobolev spaces on manifolds (or on vector bundles over manifolds). These will be the Banach spaces of sections we were after
More informationSupremum and Infimum
Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationChapter 1 PREFERENCE MODELLING. Stefano Moretti LAMSADE-CNRS, Université Paris Dauphine, Paris Cedex 16, France.
Chapter 1 PREFERENCE MODELLING Stefano Moretti LAMSADE-CNRS, Université Paris Dauphine, 75775 Paris Cedex 16, France moretti@lamsade.dauphine.fr Meltem Öztürk LAMSADE-CNRS, Université Paris Dauphine, 75775
More information1 Initial Notation and Definitions
Theory of Computation Pete Manolios Notes on induction Jan 21, 2016 In response to a request for more information on induction, I prepared these notes. Read them if you are interested, but this is not
More informationChapter 2 Axiomatic Set Theory
Chapter 2 Axiomatic Set Theory Ernst Zermelo (1871 1953) was the first to find an axiomatization of set theory, and it was later expanded by Abraham Fraenkel (1891 1965). 2.1 Zermelo Fraenkel Set Theory
More informationSubjective multi-prior probability: a representation of a partial l
Subjective multi-prior probability: a representation of a partial likelihood relation TAU, 22-11-2011 Outline of the talk: Motivation Background Examples Axioms Result Related literature Outline of the
More informationAPPROXIMATE PROBABILITY AND EXPECTATION OF GAMBLES
PATRICK SUPPES APPROXIMATE PROBABILITY AND EXPECTATION OF GAMBLES I. INTRODUCTION After many years of work in the theory of measurement and closely related topics in the foundations of probability, I have
More informationRedundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules José L. Balcázar Departament de Llenguatges i Sistemes Informàtics Laboratori d Algorísmica Relacional, Complexitat i Aprenentatge
More informationLebesgue Measure. Dung Le 1
Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its
More informationMathematical Social Sciences
Mathematical Social Sciences 74 (2015) 68 72 Contents lists available at ScienceDirect Mathematical Social Sciences journal homepage: www.elsevier.com/locate/econbase Continuity, completeness, betweenness
More informationConjoint measurement tools for MCDM A brief introduction 1
Conjoint measurement tools for MCDM A brief introduction 1 Denis Bouyssou 2 CNRS LAMSADE Marc Pirlot 3 Faculté Polytechnique de Mons Revised 21 May 2003 1 Part of this work was accomplished while Denis
More informationModule 3. Function of a Random Variable and its distribution
Module 3 Function of a Random Variable and its distribution 1. Function of a Random Variable Let Ω, F, be a probability space and let be random variable defined on Ω, F,. Further let h: R R be a given
More informationChapter 2. Assertions. An Introduction to Separation Logic c 2011 John C. Reynolds February 3, 2011
Chapter 2 An Introduction to Separation Logic c 2011 John C. Reynolds February 3, 2011 Assertions In this chapter, we give a more detailed exposition of the assertions of separation logic: their meaning,
More informationGood and bad objects: the symmetric difference rule. Abstract
Good and bad objects: the symmetric difference rule Dinko Dimitrov Tilburg University Peter Borm Tilburg University Ruud Hendrickx Tilburg University Abstract We consider the problem of ranking sets of
More informationAGGREGATION OPERATORS FOR MULTICRITERIA DECISION AID. Jean-Luc Marichal University of Liège
AGGREGATION OPERATORS FOR MULTICRITERIA DECISION AID by Jean-Luc Marichal University of Liège 1 2 1. Aggregation in MCDM Set of alternatives A = {a, b, c,...} Set of criteria N = {1,..., n}. For all i
More informationPsychophysical Foundations of the Cobb-Douglas Utility Function
Psychophysical Foundations of the Cobb-Douglas Utility Function Rossella Argenziano and Itzhak Gilboa March 2017 Abstract Relying on a literal interpretation of Weber s law in psychophysics, we show that
More informationConditional and Dynamic Preferences
Conditional and Dynamic Preferences How can we Understand Risk in a Dynamic Setting? Samuel Drapeau Joint work with Hans Föllmer Humboldt University Berlin Jena - March 17th 2009 Samuel Drapeau Joint work
More informationQUASI-PREFERENCE: CHOICE ON PARTIALLY ORDERED SETS. Contents
QUASI-PREFERENCE: CHOICE ON PARTIALLY ORDERED SETS ZEFENG CHEN Abstract. A preference relation is a total order on a finite set and a quasipreference relation is a partial order. This paper first introduces
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationSubjective expected utility without preferences
Subjective expected utility without preferences Denis Bouyssou 1 Thierry Marchant 2 24 September 2010 Abstract This paper shows that subjective expected utility can be obtained using primitives that are
More informationRelations. Binary Relation. Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation. Let R A B be a relation from A to B.
Relations Binary Relation Let A and B be sets. A (binary) relation from A to B is a subset of A B. Notation Let R A B be a relation from A to B. If (a, b) R, we write a R b. 1 Binary Relation Example:
More information9. Quantifier-free Equality and Data Structures
9. Quantifier-free Equality and Data Structures The Theory of Equality T E Σ E : {=, a, b, c,..., f, g, h,..., p, q, r,...} uninterpreted symbols: constants a, b, c,... functions f, g, h,... predicates
More informationHierarchy among Automata on Linear Orderings
Hierarchy among Automata on Linear Orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 Abstract In a preceding paper, automata and rational
More information