Conjoint measurement

Similar documents
Decisions with multiple attributes

CONJOINT MEASUREMENT TOOLS FOR MCDM A brief introduction

Conjoint measurement tools for MCDM A brief introduction 1

Two Factor Additive Conjoint Measurement With One Solvable Component

Multiattribute preference models with reference points

Certainty Equivalent Representation of Binary Gambles That Are Decomposed into Risky and Sure Parts

An axiomatic approach to ELECTRE TRI 1

Reference-based Preferences Aggregation Procedures in Multicriteria Decision Making

Advances in the Use of MCDA Methods in Decision-Making

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

Nontransitive Decomposable Conjoint Measurement 1

Static Decision Theory Under Certainty

CONSTRUCTION OF THE REAL NUMBERS.

Conjoint Measurement Models for Preference Relations

Conjoint Measurement without Additivity and Transitivity

Linear Programming Duality

A note on the asymmetric part of an outranking relation

3/1/2016. Intermediate Microeconomics W3211. Lecture 3: Preferences and Choice. Today s Aims. The Story So Far. A Short Diversion: Proofs

Using the Kappalab R package for capacity identification in Choquet integral based MAUT

A characterization of the 2-additive Choquet integral

Great Expectations. Part I: On the Customizability of Generalized Expected Utility*

September Math Course: First Order Derivative

An axiomatic analysis of concordance-discordance relations

Preference, Choice and Utility

Individual decision-making under certainty

Chapter 2 An Overview of Multiple Criteria Decision Aid

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way

Expected utility without full transitivity

Analyzing the correspondence between non-strict and strict outranking relations

An additively separable representation in the Savage framework

Integer Linear Programs

Preference for Commitment

Intro to Economic analysis

Monotone comparative statics Finite Data and GARP

Ordinary Differential Equation Introduction and Preliminaries

Uncertainty. Michael Peters December 27, 2013

The New Palgrave: Separability

Discrete Structures Proofwriting Checklist

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way

Measurement Theory for Software Engineers

lamsade 328 Novembre 2012 Laboratoire d Analyses et Modélisation de Systèmes pour l Aide à la Décision UMR 7243

Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Intro to Learning Theory Date: 12/8/16

The possible and the necessary for multiple criteria group decision

6.254 : Game Theory with Engineering Applications Lecture 8: Supermodular and Potential Games

Additive Consistency of Fuzzy Preference Relations: Characterization and Construction. Extended Abstract

GAI Networks for Decision Making under Certainty

STEP Support Programme. STEP 2 Matrices Topic Notes

PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms

A conjoint measurement approach to the discrete Sugeno integral

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3

Lecture 04 Decision Making under Certainty: The Tradeoff Problem

Axiomatic Decision Theory

0. Introduction 1 0. INTRODUCTION

Session-Based Queueing Systems

2 Systems of Linear Equations

CS 6820 Fall 2014 Lectures, October 3-20, 2014

On some ordinal models for decision making under uncertainty

Linear Algebra, Summer 2011, pt. 2

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012

Preference and Utility

First-Order Ordinary Differntial Equations II: Autonomous Case. David Levermore Department of Mathematics University of Maryland.

Integer Programming ISE 418. Lecture 8. Dr. Ted Ralphs

Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction

1 A Non-technical Introduction to Regression

Psychophysical Foundations of the Cobb-Douglas Utility Function

CS168: The Modern Algorithmic Toolbox Lecture #6: Regularization

Numerical representations of binary relations with thresholds: A brief survey 1

1 Primals and Duals: Zero Sum Games

Econ Slides from Lecture 10

Statistics Boot Camp. Dr. Stephanie Lane Institute for Defense Analyses DATAWorks 2018

A Brief Introduction to Proofs

Interactive Multi-Objective Optimization (MOO) using a Set of Additive Value Functions

Additive Combinatorics Lecture 12

Incompatibility Paradoxes

(Refer Slide Time: 00:10)

Linear Algebra. Preliminary Lecture Notes

Computational Tasks and Models

Markov Decision Processes with Ordinal Rewards: Reference Point-Based Preferences

MATH 320, WEEK 7: Matrices, Matrix Operations

LIMITS AND DERIVATIVES

This is designed for one 75-minute lecture using Games and Information. October 3, 2006

Metric spaces and metrizability

A Guide to Proof-Writing

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 37

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 24

September 2007, France

* 8 Groups, with Appendix containing Rings and Fields.

An axiomatic approach to noncompensatory sorting methods in MCDM II : More than two categories

Definitions: A binary relation R on a set X is (a) reflexive if x X : xrx; (f) asymmetric if x, x X : [x Rx xr c x ]

Computational Learning Theory

Anscombe & Aumann Expected Utility Betting and Insurance

CS261: Problem Set #3

CS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016

MATH MW Elementary Probability Course Notes Part I: Models and Counting

Fair allocation of indivisible goods

FUZZY ASSOCIATION RULES: A TWO-SIDED APPROACH

f( x) f( y). Functions which are not one-to-one are often called many-to-one. Take the domain and the range to both be all the real numbers:

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.

Making the grade: Part II

Transcription:

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 category of hotel distance to beach Wifi cultural interest A 200 e 15 12 h *** 45 km Y ++ B 425 e 18 15 h **** 0 km N C 150 e 4 7 h ** 250 km N + D 300 e 5 10 h *** 5 km Y Central problems helping a DM choose between these packages helping a DM structure his/her preferences 2

Introduction Motivation Two different contexts 1 decision aiding careful analysis of objectives careful analysis of attributes careful selection of alternatives availability of the DM 2 recommendation systems no analysis of objectives attributes as available alternatives as available limited access to the user 3 Introduction Motivation Basic model additive value function model n x y v i (x i ) n v i (y i ) i=1 i=1 x, y : alternatives x i : evaluation of alternative x on attribute i v i (x i ) : number underlies most existing MCDM techniques Underlying theory: conjoint measurement Economics (Debreu, 1960) Psychology (Luce & Tukey, 1964) tools to help structure preferences 4

Outline Outline 1 An aside: measurement in Physics 2 An example: even swaps 3 Notation 4 Additive value functions: outline of theory 5 Additive value functions: implementation 5 Measurement in Physics Aside: measurement of physical quantities Lonely individual on a desert island no tools, no books, no knowledge of Physics wants to rebuild a system of physical measures A collection a rigid straight rods problem: measuring the length of these rods pre-theoretical intuition length softness, beauty 3 main steps comparing objects creating and comparing new objects creating standard sequences 7

Measurement in Physics Step 1: comparing objects experiment to conclude which rod has more length place rods side by side on the same horizontal plane a a b b a a b b 8 Measurement in Physics Comparing objects Results a b: extremity of rod a is higher than extremity of rod b a b: extremity of rod a is as high as extremity of rod b Expected properties a b, a b or b a is asymmetric is symmetric is transitive is transitive and combine nicely a b and b c a c a b and b c a c 9

Measurement in Physics Comparing objects Summary of experiments binary relation = that is a weak order complete (a b or b a) transitive (a b and b c a c) Consequences associate a real number Φ(a) to each object a the comparison of numbers faithfully reflects the results of experiments a b Φ(a) > Φ(b) a b Φ(a) = Φ(b) the function Φ defines an ordinal scale applying an increasing transformation to Φ leads to a scale that has the same properties any two scales having the same properties are related by an increasing transformation 10 Measurement in Physics Step 2: creating and comparing new objects use the available objects to create new ones concatenate objects by placing two or more rods in a row b d a c a b c d a b c d 11

Measurement in Physics Concatenation Constraints induced by concatenation we want to be able to deduce Φ(a b) from Φ(a) and Φ(b) simplest requirement Φ(a b) = Φ(a) + Φ(b) monotonicity constraints a b and c d a c b d 12 Measurement in Physics Step 3: creating and using standard sequences choose a standard rod be able to build perfect copies of the standard concatenate the standard rod with its perfects copies a S(k) s 8 s 7 s 6 s 5 s 4 s 3 s 2 s 1 S(8) a S(7) Φ(s) = 1 7 < Φ(a) < 8 13

Convergence Measurement in Physics First method choose a smaller standard rod repeat the process Second method prepare a perfect copy of the object concatenate the object with its perfect copy compare the doubled object to the original standard sequence repeat the process 14 Summary Measurement in Physics Extensive measurement Krantz, Luce, Suppes & Tversky (1971, chap. 3) 4 Ingredients 1 well-behaved relations and 2 concatenation operation 3 consistency requirements linking, and 4 ability to prepare perfect copies of some objects in order to build standard sequences Neglected problems many! 15

Question Measurement in Physics Can this be applied outside Physics? no concatenation operation (intelligence!) 16 Measurement in Physics What is conjoint measurement? Conjoint measurement mimicking the operations of extensive measurement when there are no concatenation operation readily available when several dimensions are involved Seems overly ambitious let us start with a simple example 17

An example: even swaps Example: Hammond, Keeney & Raiffa, 1999 Choice of an office to rent five locations have been identified five attributes are being considered Commute time (minutes) Clients: percentage of clients living close to the office Services: ad hoc scale A (all facilities), B (telephone and fax), C (no facility) Attributes Size: square feet ( 0.1 m 2 ) Cost: $ per month Commute, Size and Cost are natural attributes Clients is a proxy attribute Services is a constructed attribute 19 Data An example: even swaps a b c d e Commute 45 25 20 25 30 Clients 50 80 70 85 75 Services A B C A C Size 800 700 500 950 700 Cost 1850 1700 1500 1900 1750 Hypotheses and context a single cooperative DM choice of a single office ceteris paribus reasoning seems possible Commute: decreasing Services: increasing Cost: decreasing dominance has meaning Clients: increasing Size: increasing 20

An example: even swaps a b c d e Commute 45 25 20 25 30 Clients 50 80 70 85 75 Services A B C A C Size 800 700 500 950 700 Cost 1850 1700 1500 1900 1750 b dominates alternative e d is close to dominating a divide and conquer: dropping alternatives drop a and e 21 An example: even swaps b c d Commute 25 20 25 Clients 80 70 85 Services B C A Size 700 500 950 Cost 1700 1500 1900 no more dominance assessing tradeoffs all alternatives except c have a common evaluation on Commute modify c in order to bring it to this level starting with c, what is the gain on Clients that would exactly compensate a loss of 5 min on Commute? difficult but central question 22

An example: even swaps c c Commute 20 25 Clients 70 70 + δ Services C C Size 500 500 Cost 1500 1500 find δ such that c c Answer for δ = 8, I am indifferent between c and c replace c with c 23 An example: even swaps b c d Commute 25 25 25 Clients 80 78 85 Services B C A Size 700 500 950 Cost 1700 1500 1900 all alternatives have a common evaluation on Commute divide and conquer: dropping attributes drop attribute Commute b c d Clients 80 78 85 Services B C A Size 700 500 950 Cost 1700 1500 1900 24

An example: even swaps b c d Clients 80 78 85 Services B C A Size 700 500 950 Cost 1700 1500 1900 check again for dominance unfruitful assess new tradeoffs neutralize Services using Cost as reference 25 An example: even swaps b c d Clients 80 78 85 Services B C A Size 700 500 950 Cost 1700 1500 1900 Questions what maximal increase on Cost would you be prepared to pay to go from C to B on Services for c? answer: 250 $ what minimal decrease on Cost would you ask if we go from A to B on Services for d? answer: 100 $ b c c d d Clients 80 78 78 85 85 Services B C B A B Size 700 500 500 950 950 Cost 1700 1500 1500 + 250 1900 1900 100 26

An example: even swaps replacing c with c replacing d with d dropping Services b c d Clients 80 78 85 Size 700 500 950 Cost 1700 1750 1800 checking for dominance: c is dominated by b c can be dropped 27 An example: even swaps dropping c b d Clients 80 85 Size 700 950 Cost 1700 1800 no dominance question: starting with b what is the additional amount on Cost that you would be prepared to pay to increase Size by 250? answer: 250 $ b b d Clients 80 80 85 Size 700 950 950 Cost 1700 1700 + 250 1800 28

An example: even swaps replace b with b drop Size b d Clients 80 85 Size 950 950 Cost 1950 1800 b d Clients 80 85 Cost 1950 1800 check for dominance d dominates b Conclusion Recommend d as the final choice 29 Summary An example: even swaps Remarks very simple process process entirely governed by and no question on intensity of preference notice that importance is not even mentioned it is there but in a more complex form than just weights why be interested in something more complex? Problems set of alternative is small many questions otherwise output is not a preference model if new alternatives appear, the process should be restarted what are the underlying hypotheses? 30

An example: even swaps Monsieur Jourdain doing conjoint measurement Similarity with extensive measurement : preference, : indifference we have implicitly supposed that they combine nicely Recommendation: d we should be able to prove that d a, d b, d c and d e dominance: b e and d a tradeoffs + dominance: b c, c c, c c, d d, b b, d b d a, b e c c, c c, b c b c d d, b b, d b d b 31 An example: even swaps Monsieur Jourdain doing conjoint measurement OK... but where are the standard sequences? hidden... but really there! standard sequence for length: objects that have exactly the same length tradeoffs: preference intervals on distinct attributes that have the same length c c [25, 20] on Commute has the same length as [70, 78] on Client c c f f Commute 20 25 20 25 Clients 70 78 78 82 Services C C C C Size 500 500 500 500 Cost 1500 1500 1500 1500 [70, 78] has the same length [78, 82] on Client 32

Setting Notation N = {1, 2,..., n} set of attributes X i : set of possible levels on the ith attribute X = n i=1 X i: set of all conceivable alternatives X include the alternatives under study... and many others J N: subset of attributes X J = j J X j, X J = j / J X j (x J, y J ) X (x i, y i ) X : binary relation on X: at least as good as x y x y and Not[y x] x y x y and y x 34 Notation What will be ignored today Important issues ignored structuring of objectives from objectives to attributes adequate family of attributes risk, uncertainty, imprecision 35

Notation Marginal preference and independence Marginal preferences J N: subset of attributes J marginal preference relation induced by on X J x J J y J (x J, z J ) (y J, z J ), for all z J X J Independence J is independent for if [(x J, z J ) (y J, z J ), for some z J X J ] x J J y J common levels on attributes other than J do not affect preference 36 Independence Notation Definition for all i N, {i} is independent, is weakly independent for all J N, J is independent, is independent Proposition (Folk) Let be a weakly independent weak order on X = n i=1 X i. Then: i is a weak order on X i [x i i y i, for all i N] x y [x i i y i, for all i N and x j j y j for some j N] x y for all x, y X Dominance as soon as I have a weakly independent weak order dominance arguments apply 37

Notation Independence in practice Independence it is easy to imagine examples in which independence is violated Main course and Wine example (Fish, WW) (Meat, WW) (Meat, RW) (Fish, RW) it is nearly hopeless to try to work if weak independence is not satisfied some (e.g., R. L. Keeney) think that the same is true for independence in all cases if independence is violated, things get complicated decision aiding vs AI 38 Additive value functions: outline of theory Outline of theory: 2 attributes The case of 2 attributes Question suppose I can observe on X = X 1 X 2 asking questions to the DM what must be supposed to guarantee that I can represent in the additive value function model v 1 : X 1 R v 2 : X 2 R (x 1, x 2 ) (y 1, y 2 ) v 1 (x 1 ) + v 2 (x 2 ) v 1 (y 1 ) + v 2 (y 2 ) must be an independent weak order Method try building standard sequences and see if it works! 40

Uniqueness Additive value functions: outline of theory The case of 2 attributes Important observation Suppose that there are v 1 and v 2 such that (x 1, x 2 ) (y 1, y 2 ) v 1 (x 1 ) + v 2 (x 2 ) v 1 (y 1 ) + v 2 (y 2 ) If α > 0 w 1 = αv 1 + β 1 w 2 = αv 2 + β 2 is also a valid representation Consequences fixing v 1 (x 1 ) = v 2 (x 2 ) = 0 is harmless fixing v 1 (y 1 ) = 1 is harmless if y 1 1 x 1 41 Additive value functions: outline of theory Standard sequences The case of 2 attributes Preliminaries choose arbitrarily two levels x 0 1, x 1 1 X 1 make sure that x 1 1 1 x 0 1 choose arbitrarily one level x 0 2 X 2 (x 0 1, x 0 2) X is the reference point (origin) the preference interval [x 0 1, x 1 1] is the unit 42

Additive value functions: outline of theory The case of 2 attributes Building a standard sequence on X 2 find a preference interval on X 2 that has the same length as the reference interval [x 0 1, x 1 1] find x 1 2 such that (x 0 1, x 1 2) (x 1 1, x 0 2) v 1 (x 0 1) + v 2 (x 1 2) = v 1 (x 1 1) + v 2 (x 0 2) so that v 2 (x 1 2) v 2 (x 0 2) = v 1 (x 1 1) v 1 (x 0 1) the structure of X 2 has to be rich enough 43 Additive value functions: outline of theory Standard sequences The case of 2 attributes Consequences (x 0 1, x 1 2) (x 1 1, x 0 2) v 2 (x 1 2) v 2 (x 0 2) = v 1 (x 1 1) v 1 (x 0 1) it can be supposed that v 1 (x 0 1) = v 2 (x 0 2) = 0 v 1 (x 1 1) = 1 v 2 (x 1 2) = 1 44

Going on Additive value functions: outline of theory The case of 2 attributes (x 0 1, x 1 2) (x 1 1, x 0 2) (x 0 1, x 2 2) (x 1 1, x 1 2) (x 0 1, x 3 2) (x 1 1, x 2 2)... (x 0 1, x k 2) (x 1 1, x k 1 2 ) v 2 (x 1 2) v 2 (x 0 2) = v 1 (x 1 1) v 1 (x 0 1) = 1 v 2 (x 2 2) v 2 (x 1 2) = v 1 (x 1 1) v 1 (x 0 1) = 1 v 2 (x 3 2) v 2 (x 2 2) = v 1 (x 1 1) v 1 (x 0 1) = 1... v 2 (x k 2) v 2 (x k 1 2 ) = v 1 (x 1 1) v 1 (x 0 1) = 1 v 2 (x 2 2) = 2, v 2 (x 3 2) = 3,..., v 2 (x k 2) = k 45 X 2 x 4 2 x 3 2 x 2 2 x 1 2 x 0 2 x 0 1 x 1 1 X 1

Additive value functions: outline of theory Standard sequence The case of 2 attributes Archimedean implicit hypothesis for length the standard sequence can reach the length of any object x, y R, n N : ny > x a similar hypothesis has to hold here rough interpretation there are not infinitely liked or disliked consequences 47 Additive value functions: outline of theory The case of 2 attributes Building a standard sequence on X 1 (x 2 1, x 0 2) (x 1 1, x 1 2) (x 3 1, x 0 2) (x 2 1, x 1 2)... (x k 1, x 0 2) (x k 1 1, x 1 2) v 1 (x 2 1) v 1 (x 1 1) = v 2 (x 1 2) v 2 (x 0 2) = 1 v 1 (x 3 1) v 1 (x 2 1) = v 2 (x 1 2) v 2 (x 0 2) = 1... v 1 (x k 1) v 1 (x k 1 1 ) = v 2 (x 1 2) v 2 (x 0 2) = 1 v 1 (x 2 1) = 2, v 1 (x 3 1) = 3,..., v 1 (x k 1) = k 48

X 2 x 1 2 x 0 2 x 0 1 x 1 1 x 2 1 x 3 1 x 4 1 X 1 X 2 x 4 2 x 3 2 x 2 2 x 1 2 x 0 2 x 0 1 x 1 1 x 2 1 x 3 1 x 4 1 X 1

X 2 x 4 2 x 3 2 x 2 2? x 1 2 x 0 2 x 0 1 x 1 1 x 2 1 x 3 1 x 4 1 X 1 Additive value functions: outline of theory Thomsen condition The case of 2 attributes (x 1, x 2 ) (y 1, y 2 ) and (y 1, z 2 ) (z 1, x 2 ) (x 1, z 2 ) (z 1, y 2 ) X 2 z 2 y 2 x 2 y 1 x 1 z 1 X 1 Consequence there is an additive value function on the grid 52

X 2 x 4 2 x 3 2 x 2 2 x 1 2 x 0 2 x 0 1 x 1 1 x 2 1 x 3 1 x 4 1 x 5 1 X 1 Summary Additive value functions: outline of theory The case of 2 attributes we have defined a grid there is an additive value function on the grid iterate the whole process with a denser grid 54

Additive value functions: outline of theory Hypotheses The case of 2 attributes Archimedean: every strictly bounded standard sequence is finite essentiality: both 1 and 2 are nontrivial restricted solvability 55 X 2 x 2 (z 1, z 2 ) (w 1, x 2 ) (x 1, x 2 ) (y 1, x 2 ) (y 1, x 2 ) (z 1, z 2 ) (z 1, z 2 ) (x 1, x 2 ) X 1 x 1 y 1 } w 1 such that (z 1, z 2 ) (w 1, x 2 )

Additive value functions: outline of theory Basic result The case of 2 attributes Theorem (2 attributes) If restricted solvability holds each attribute is essential then the additive value function model holds if and only if is an independent weak order satisfying the Thomsen and the Archimedean conditions The representation is unique up to scale and location 57 Additive value functions: outline of theory General case More than 2 attributes Good news entirely similar... with a very nice surprise: Thomsen can be forgotten if n = 2, independence is identical with weak independence if n > 3, independence is much stronger than weak independence 58

Additive value functions: outline of theory Basic result More than 2 attributes Theorem (more than 2 attributes) If restricted solvability holds at least three attributes are essential then the additive value function model holds if and only if is an independent weak order satisfying the Archimedean condition The representation is unique up to scale and location 59 Additive value functions: outline of theory Independence and even swaps More than 2 attributes Even swaps technique assessing tradeoffs... after having suppressed attributes Implicit hypothesis what happens on these attributes do not influence tradeoffs this is another way to formulate independence 60

Additive value functions: implementation Assessing value functions Direct techniques Standard technique check independence build standard sequences weights (importance) has no explicit rôle do not even pronounce the word!! Problems many questions questions on fictitious alternatives rests on indifference judgments discrete attributes propagation of errors 62 Additive value functions: implementation Indirect techniques Indirect techniques Principle select a number of reference alternatives that the DM knows well rank order these alternatives test, using LP, if this information is compatible with an additive value function if yes, present a central one interact with the DM apply the resulting function to the whole set of alternatives if not interact with the DM 63

Summary Additive value functions: implementation Indirect techniques Conjoint measurement highly consistent theory together with practical assessment techniques Why consider extensions? hypotheses may be violated assessment is demanding time cognitive effort 64 References Bouyssou, D., Pirlot, M. (2005) Conjoint measurement tools for MCDM. A brief introduction in Multiple Criteria Decision Analysis. State of the art surveys, pp. 73 130 Figueira, J. et al. (Eds), Springer, 2005 Krantz, D. H., Luce, R. D., Suppes, P., and Tversky, A. (1971) Foundations of measurement, vol. 1: Additive and polynomial representations Academic Press, New York. Keeney, R. L. and Hammond, J. S. and Raiffa, H. (1999) Smart choices: A guide to making better decisions Harvard University Press, Boston.