|
Share of Preference Options
|
|
|
|
| 1. Subject the respondent's total utilities for the product to the exponential transformation (also known as the antilog): s = exp(utility).
|
|
|
| 2. Rescale the resulting numbers so they sum to 100.
|
|
|
|
|
| product share of
|
| utility exp(utility) preference
|
| A 1.0 2.72 26.9
|
| B 2.0 7.39 73.1
|
|
|
|
|
| For multiplier of 0.1
|
| product share of
|
| utility exp(utility) preference
|
| A 1.0 1.105 47.5
|
| B 2.0 1.221 52.5
|
|
|
| For multiplier of 10.
|
| product share of
|
| utility exp(utility) preference
|
| A 10.0 22026 100.005
|
| B 20.0 4.85E08 99.995
|
|
|
|
|
| 1. | For the n products in a simulation, an n x n similarity matrix is computed, with 1's indicating complete similarity, 0's indicating total lack of similarity, and fractional values for differing degrees of similarity:
|
|
|
| First a "dissimilarity" matrix is computed. Consider a scale for each attribute where its levels are coded 10, 20, 30, and so on. The dissimilarity of a pair of products on an attribute is taken as the absolute difference between their codes, but with a maximum of 10. (This allows "continuous" and "categorical" attributes to be treated in the same way.) The total dissimilarity between two products is the sum of their dissimilarities over all attributes. Two products differing by an entire level on each attribute are maximally dissimilar.
|
|
|
| Next, total dissimilarities are rescaled by a constant so the maximum possible is 3.0, rather than 10 times the number of attributes.
|
|
|
| Dissimilarities are then converted to similarities by a negative exponential transformation. At this point the minimum possible similarity is exp(-3) ~ .05, achieved if two products have completely different levels on every attribute, and the maximum possible similarity is exp(0) = 1, achieved only if they have identical levels on all attributes.
|
|
|
| Finally, the similarities are subjected to a further rescaling that sets the minimum to 0 and the maximum to 1.
|
|
|
| 2. | Column totals of the similarity matrix are calculated to get a vector of "total similarities." The smallest possible value is 1.0, which is found if a product is maximally dissimilar to all others and similar only to itself. If two products are identical but maximally dissimilar to all others, those products each have values of 2.0.
|
|
|
| 3. | For each respondent, shares of preference are divided by corresponding "total similarities," and then renormalized to have sum of unity. This has the effect of reducing shares for products that are relatively similar to others, and increasing shares for products that are relatively unique. In the limit, where two or more products are identical and totally unlike any others, they divide among themselves the share that each product would have if the others were not present.
|