Representation and Inference of Lexicographic Preference Models and Their Variants

The authors propose two variants of lexicographic preference rules. They obtain the necessary and sufficient conditions under which a linear utility function represents a standard lexicographic rule, and each of the proposed variants, over a set of discrete attributes. They then: (i) characterize th...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:Marketing Science. - Institute for Operations Research and the Management Sciences. - 26(2007), 3, Seite 380-399
1. Verfasser: Kohli, Rajeev (VerfasserIn)
Weitere Verfasser: Jedidi, Kamel
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2007
Zugriff auf das übergeordnete Werk:Marketing Science
Schlagworte:lexicographic preferences noncompensatory preference models linear models optimization techniques greedy algorithm approximation algorithms utility theory conjoint analysis hierarchical clustering market segmentation mehr... hierarchical market structures Linguistics Information science Applied sciences Business Behavioral sciences Economics Mathematics
LEADER 01000caa a22002652 4500
001 JST056347200
003 DE-627
005 20240622022637.0
007 cr uuu---uuuuu
008 150324s2007 xx |||||o 00| ||eng c
035 |a (DE-627)JST056347200 
035 |a (JST)40057064 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Kohli, Rajeev  |e verfasserin  |4 aut 
245 1 0 |a Representation and Inference of Lexicographic Preference Models and Their Variants 
264 1 |c 2007 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
520 |a The authors propose two variants of lexicographic preference rules. They obtain the necessary and sufficient conditions under which a linear utility function represents a standard lexicographic rule, and each of the proposed variants, over a set of discrete attributes. They then: (i) characterize the measurement properties of the parameters in the representations; (ii) propose a nonmetric procedure for inferring each lexicographic rule from pairwise comparisons of multiattribute alternatives; (iii) describe a method for distinguishing among different lexicographic rules, and between lexicographic and linear preference models; and (iv) suggest how individual lexicographic rules can be combined to describe hierarchical market structures. The authors illustrate each of these aspects using data on personal-computer preferences. They find that two-thirds of the subjects in the sample use some kind of lexicographic rule. In contrast, only one in five subjects use a standard lexicographic rule. This suggests that lexicographic rules are more widely used by consumers than one might have thought in the absence of the lexicographic variants described in the paper. The authors report a simulation assessing the ability of the proposed inference procedure to distinguish among alternative lexicographic models, and between linear-compensatory and lexicographic models. 
540 |a Copyright 2007 INFORMS 
650 4 |a lexicographic preferences 
650 4 |a noncompensatory preference models 
650 4 |a linear models 
650 4 |a optimization techniques 
650 4 |a greedy algorithm 
650 4 |a approximation algorithms 
650 4 |a utility theory 
650 4 |a conjoint analysis 
650 4 |a hierarchical clustering 
650 4 |a market segmentation 
650 4 |a hierarchical market structures 
650 4 |a Linguistics  |x Language  |x Lexicology  |x Lexicography 
650 4 |a Information science  |x Information analysis  |x Data analysis  |x Regression analysis  |x Linear regression  |x Linear models 
650 4 |a Applied sciences  |x Research methods  |x Modeling 
650 4 |a Business  |x Business administration  |x Corporate communications  |x External corporate communications  |x Marketing 
650 4 |a Behavioral sciences  |x Psychology  |x Cognitive psychology  |x Cognitive processes  |x Thought processes  |x Reasoning  |x Inference 
650 4 |a Economics  |x Microeconomics  |x Economic utility  |x Utility functions 
650 4 |a Applied sciences  |x Computer science  |x Algorithms  |x Greedy algorithms 
650 4 |a Mathematics  |x Applied mathematics  |x Statistics  |x Applied statistics  |x Statistical models  |x Parametric models 
650 4 |a Business  |x Business administration  |x Corporate communications  |x External corporate communications  |x Marketing  |x Branding  |x Brands 
650 4 |a Economics  |x Economic disciplines  |x Financial economics  |x Financial market structures 
650 4 |a Linguistics  |x Language  |x Lexicology  |x Lexicography 
650 4 |a Information science  |x Information analysis  |x Data analysis  |x Regression analysis  |x Linear regression  |x Linear models 
650 4 |a Applied sciences  |x Research methods  |x Modeling 
650 4 |a Business  |x Business administration  |x Corporate communications  |x External corporate communications  |x Marketing 
650 4 |a Behavioral sciences  |x Psychology  |x Cognitive psychology  |x Cognitive processes  |x Thought processes  |x Reasoning  |x Inference 
650 4 |a Economics  |x Microeconomics  |x Economic utility  |x Utility functions 
650 4 |a Applied sciences  |x Computer science  |x Algorithms  |x Greedy algorithms 
650 4 |a Mathematics  |x Applied mathematics  |x Statistics  |x Applied statistics  |x Statistical models  |x Parametric models 
650 4 |a Business  |x Business administration  |x Corporate communications  |x External corporate communications  |x Marketing  |x Branding  |x Brands 
650 4 |a Economics  |x Economic disciplines  |x Financial economics  |x Financial market structures 
655 4 |a research-article 
700 1 |a Jedidi, Kamel  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t Marketing Science  |d Institute for Operations Research and the Management Sciences  |g 26(2007), 3, Seite 380-399  |w (DE-627)320627799  |w (DE-600)2023536-7  |x 1526548X  |7 nnns 
773 1 8 |g volume:26  |g year:2007  |g number:3  |g pages:380-399 
856 4 0 |u https://www.jstor.org/stable/40057064  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_JST 
912 |a GBV_ILN_11 
912 |a GBV_ILN_20 
912 |a GBV_ILN_22 
912 |a GBV_ILN_23 
912 |a GBV_ILN_24 
912 |a GBV_ILN_31 
912 |a GBV_ILN_32 
912 |a GBV_ILN_39 
912 |a GBV_ILN_40 
912 |a GBV_ILN_60 
912 |a GBV_ILN_62 
912 |a GBV_ILN_63 
912 |a GBV_ILN_65 
912 |a GBV_ILN_69 
912 |a GBV_ILN_70 
912 |a GBV_ILN_90 
912 |a GBV_ILN_95 
912 |a GBV_ILN_100 
912 |a GBV_ILN_110 
912 |a GBV_ILN_120 
912 |a GBV_ILN_152 
912 |a GBV_ILN_187 
912 |a GBV_ILN_224 
912 |a GBV_ILN_285 
912 |a GBV_ILN_374 
912 |a GBV_ILN_702 
912 |a GBV_ILN_2001 
912 |a GBV_ILN_2003 
912 |a GBV_ILN_2005 
912 |a GBV_ILN_2006 
912 |a GBV_ILN_2007 
912 |a GBV_ILN_2008 
912 |a GBV_ILN_2009 
912 |a GBV_ILN_2010 
912 |a GBV_ILN_2011 
912 |a GBV_ILN_2014 
912 |a GBV_ILN_2015 
912 |a GBV_ILN_2018 
912 |a GBV_ILN_2020 
912 |a GBV_ILN_2021 
912 |a GBV_ILN_2026 
912 |a GBV_ILN_2027 
912 |a GBV_ILN_2034 
912 |a GBV_ILN_2044 
912 |a GBV_ILN_2048 
912 |a GBV_ILN_2050 
912 |a GBV_ILN_2055 
912 |a GBV_ILN_2056 
912 |a GBV_ILN_2057 
912 |a GBV_ILN_2059 
912 |a GBV_ILN_2061 
912 |a GBV_ILN_2065 
912 |a GBV_ILN_2068 
912 |a GBV_ILN_2106 
912 |a GBV_ILN_2107 
912 |a GBV_ILN_2108 
912 |a GBV_ILN_2111 
912 |a GBV_ILN_2112 
912 |a GBV_ILN_2113 
912 |a GBV_ILN_2118 
912 |a GBV_ILN_2122 
912 |a GBV_ILN_2129 
912 |a GBV_ILN_2143 
912 |a GBV_ILN_2147 
912 |a GBV_ILN_2148 
912 |a GBV_ILN_2152 
912 |a GBV_ILN_2153 
912 |a GBV_ILN_2190 
912 |a GBV_ILN_2232 
912 |a GBV_ILN_2472 
912 |a GBV_ILN_2935 
912 |a GBV_ILN_2940 
912 |a GBV_ILN_2949 
912 |a GBV_ILN_2950 
912 |a GBV_ILN_4012 
912 |a GBV_ILN_4035 
912 |a GBV_ILN_4037 
912 |a GBV_ILN_4046 
912 |a GBV_ILN_4112 
912 |a GBV_ILN_4125 
912 |a GBV_ILN_4126 
912 |a GBV_ILN_4242 
912 |a GBV_ILN_4246 
912 |a GBV_ILN_4249 
912 |a GBV_ILN_4251 
912 |a GBV_ILN_4305 
912 |a GBV_ILN_4306 
912 |a GBV_ILN_4307 
912 |a GBV_ILN_4313 
912 |a GBV_ILN_4322 
912 |a GBV_ILN_4323 
912 |a GBV_ILN_4324 
912 |a GBV_ILN_4325 
912 |a GBV_ILN_4326 
912 |a GBV_ILN_4335 
912 |a GBV_ILN_4338 
912 |a GBV_ILN_4346 
912 |a GBV_ILN_4393 
912 |a GBV_ILN_4700 
951 |a AR 
952 |d 26  |j 2007  |e 3  |h 380-399