Kamel Jedidi

Inferring latent class lexicographic rules from choice data

Coauthor(s): Rajeev Kohli.

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.

Source: Journal of Mathematical Psychology
Exact Citation:
Jedidi, Kamel, and Rajeev Kohli. "Inferring latent class lexicographic rules from choice data." Journal of Mathematical Psychology 52, no. 4 (2008): 241-249.
Volume: 52
Number: 4
Pages: 241-249
Date: 2008