Inferring latent class lexicographic rules from choice data

Abstract A lexicographic rule orders multi-attribute alternatives in the same way as a dictionary orders words. Although no utility function can represent lexicographic preference over continuous, real-valued attributes, a constrained linear model suffices for representing such preferences over discrete attributes. We present an algorithm for inferring lexicographic structures from choice data. The primary difficulty in using such data is that it is seldom possible to obtain sufficient information to estimate individual-level preference functions. Instead, one needs to pool the data across latent clusters of individuals. We propose a method that identifies latent clusters of subjects, and estimates a lexicographic rule for each cluster. We describe an application of the method using data collected by a manufacturer of television sets. We compare the predictions of the model with those obtained from a finite-mixture, multinomial-logit model.

[1]  Ulrich Hoffrage,et al.  Why does one-reason decision making work? A case study in ecological rationality , 1999 .

[2]  Eric R. Jensen An Econometric Analysis of the Old-Age Security Motive for Childbearing , 1990 .

[3]  Jonathan A. Stirk,et al.  Singleton bias and lexicographic preferences among equally valued alternatives , 1999 .

[4]  G. Gigerenzer,et al.  Probabilistic mental models: a Brunswikian theory of confidence. , 1991, Psychological review.

[5]  Michael Schmitt,et al.  Simplicity and Robustness of Fast and Frugal Heuristics , 1999, Minds and Machines.

[6]  R. Duncan Luce,et al.  Lexicographic tradeoff structures , 1978 .

[7]  H. W. Perry,et al.  Deciding to Decide: Agenda Setting in the United States Supreme Court , 1992 .

[8]  U. Hoffrage,et al.  Fast, frugal, and fit: Simple heuristics for paired comparison , 2002 .

[9]  D. Wittink,et al.  Commercial Use of Conjoint Analysis: A Survey , 1982 .

[10]  J. Ford,et al.  Process tracing methods: Contributions, problems, and neglected research questions , 1989 .

[11]  Peter C. Fishburn,et al.  LEXICOGRAPHIC ORDERS, UTILITIES AND DECISION RULES: A SURVEY , 1974 .

[12]  C. Coombs,et al.  Ordmet: A general algorithm for constructing all numerical solutions to ordered metric structures , 1975 .

[13]  J. Orlin,et al.  Greedoid-Based Noncompensatory Inference , 2007 .

[14]  R. Kohli,et al.  Representation and Inference of Lexicographic Preference Models and Their Variants , 2007 .

[15]  A. Tversky,et al.  Contingent weighting in judgment and choice , 1988 .

[16]  M. F. Luce,et al.  The Rationalizing Effects of Cognitive Load on Emotion-Based Trade-off Avoidance , 2004 .

[17]  Ronen I. Brafman,et al.  CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..

[18]  Rajeev Kohli Lexicographic systems , 1999 .

[19]  P. Todd,et al.  Simple Heuristics That Make Us Smart , 1999 .

[20]  Vicki Knoblauch,et al.  Lexicographic orders and preference representation , 2000 .

[21]  D. Bridges Numerical representation of intransitive preferences on a countable set , 1983 .

[22]  Mirjam R. M. Westenberg,et al.  Multi-attribute evaluation process: Methodological and conceptual issues , 1994 .

[23]  A. Tversky,et al.  Foundations of Measurement, Vol. I: Additive and Polynomial Representations , 1991 .

[24]  A. Chateauneuf Continuous representation of a preference relation on a connected topological space , 1987 .

[25]  A. Bröder Assessing the empirical validity of the "take-the-best" heuristic as a model of human probabilistic inference. , 2000, Journal of experimental psychology. Learning, memory, and cognition.

[26]  C. González-Vallejo,et al.  Effects of vague probabilities and of vague payoffs on preference: a model comparison analysis , 1996 .

[27]  Peter P. Wakker,et al.  Continuity of preference relations for separable topologies , 1988 .

[28]  Jonathan Baron,et al.  Regular ArticleProtected Values , 1997 .

[29]  A new solution to the problem of finding all numerical solutions to ordered metric structures , 1980 .

[30]  G. Debreu Mathematical Economics: Representation of a preference ordering by a numerical function , 1983 .

[31]  H. Bozdogan Model selection and Akaike's Information Criterion (AIC): The general theory and its analytical extensions , 1987 .

[32]  P. Tetlock,et al.  The psychology of the unthinkable: taboo trade-offs, forbidden base rates, and heretical counterfactuals. , 2000, Journal of personality and social psychology.

[33]  Ronen I. Brafman,et al.  Preference‐Based Constrained Optimization with CP‐Nets , 2004, Comput. Intell..

[34]  P. Slovic Choice Between Equally Valued Alternatives. , 1975 .

[35]  P. Tetlock,et al.  Taboo Trade‐offs: Reactions to Transactions That Transgress the Spheres of Justice , 1997 .