Skip to Content
EntropyEntropy
  • Article
  • Open Access

11 September 2026

35 Pages

High-Dimensional Linear Preference Model

and
Department of Mathematics, Bar-Ilan University, Ramat Gan 52900, Israel
*
Author to whom correspondence should be addressed.
This article belongs to the Section Multidisciplinary Applications

Abstract

Multiple-criteria decision analysis (MCDA) is a branch of operations research concerned with choices based on several quantifiable factors. Here, we focus on high-dimensional markets, in which each available product is described by a large number of features. Taking a probabilistic approach, we define a market as a collection of alternatives in a decision-making scenario governed by a linear utility function. Analytic approximations for the market share and its moments are derived in the limit of a large population and a large number of measured features. We identify a single parameter, termed the degree of subjectivity, that places markets on a continuous spectrum ranging from fully objective to fully subjective. At an intermediate value, the market is competitive in the sense that it maximizes the entropy of the market-share distribution. Empirical analysis of several real markets indicates that they can indeed be classified by this parameter, yielding predictable decision patterns and a unified, relative measure of competitiveness across markets. Simulations involving non-linear utility functions and a trained machine-learning classifier provide preliminary evidence that similar behavior may also arise beyond the linear model, suggesting that the degree of subjectivity may be useful as a diagnostic in some broader multi-feature decision problems.

1. Introduction

Decision theory is an active topic of research due to its direct ties with consumer-based economies, the job market, politics, and art. Studying the statistics of preference could act as a window into the dynamics of modern society, where the selection of clothes, media, activities, and careers is larger than ever [1,2]. In finance, a well-known axis of preference is the trade-off between risk and expected return, as investors need to decide how much risk they are willing to accept [3]. Decision theory is also relevant to classification methods in data science. In classification problems, decision trees or other machine learning (ML) methods are used to assign an object into one out of a given finite set of categories. One can think of the classifier as “deciding” which category to choose based on a list of features that describe the object.
To describe the multi-attribute utility model [4,5], consider a group of individuals, each asked to pick one alternative (e.g., product) out of several possible ones. Each individual makes their choice according to their own preferences. This may lead to different rankings (preference orders) of the alternatives. A common assumption in decision theory is that individuals weight the properties of products, which are summarized to a numerical score, called the utility function. Each individual then picks the alternative that provides them with the highest utility. Our main interest is in finding the market share of each alternative—the rate at which it is chosen. Intuitively, the market share should depend on the characteristics of the alternative itself, on the characteristics of other available alternatives, and on the distribution of preferences in the population.
A thorough introduction and examination of the multi-attribute utility model can be found in references [4,5]. A methodology for the practical application of discrete choice modeling can be found in reference [6], and examples for real applications are found in references [7,8]. Although the literature on discrete choice and multi-attribute utility is extensive (see [9,10,11]), much of it is concerned with the utility functions themselves, fitting the data, or about the process of making a choice, while we are more interested in the market statistics.
Another central approach in the decision theory literature comes from random utility theory, which assumes some unobserved choice preference [12,13]. In particular, the multinomial logit model [14] can predict choice in cases with taste heterogeneity using likelihood estimation methods [12,15]. For decision problems consisting of a high dimensional feature space, however, such methods may be impractical or more difficult to apply to real data. Information-theoretic models of bounded rationality present an approach to dealing with decision problems where information is not fully available by including entropy or information-processing costs as part of the problem itself [16,17].
Recent work has broadened random-utility and discrete-choice models through heterogeneous or unobserved choice sets and preferences [18], limited consideration [19], feature-dependent mixtures learned from incomplete preferences [20], and gradient-boosted utility functions that retain a random-utility interpretation [21]. These studies primarily address the identification, estimation, or prediction of heterogeneous choice mechanisms. In contrast, our focus is on the distribution of aggregate market shares induced by a given population of preferences in a many-feature limit.
Other decision-making frameworks represent uncertainty at the level of structured individual assessments: pure fuzzy-soft sets encode interactions among assessment parameters [22], whereas neutrosophic fuzzy-soft similarity methods retain membership, indeterminacy, and non-membership information [23].
Consider a market, here defined as a population of individuals who choose a single option out of a collection of available alternatives. Each alternative is described by a set of numerical features. The behavior arising from such markets seems to typically fall somewhere between fully objective and fully subjective. When the perceived utility of an alternative is not affected too much by the individual making the decision, we say that the choice is objective. This can happen if choices depend mostly on one factor, for example, when all products perform similarly, but one is cheaper. On the other end of the spectrum, when the utility varies significantly among individuals, we say that the choice is subjective. For example, choices related to politics or art are inherently subjective—beauty is in the eye of the beholder.
Between these two extremes lies what we refer to as a competitive market. A competitive market is characterized by giving alternatives equal opportunity. This is not necessarily translated into equal market share. Instead, in competitive markets, pairwise contests between random alternatives are maximally unpredictable.
The main goal of this paper is to show that, if the dimension is large enough, then under mild assumptions, the statistics of the market follow a limiting behavior that can be analyzed without having to consider specific model features. Simulations are used to generalize the analytical results. We also demonstrate the applicability of the main results to classification algorithms.
The paper is organized as follows. Section 2 defines an infinite-supply preference market along with a linear realization of the multi-attribute utility model and compares it with empirical data studies. We then simulate the model to get a basic understanding of its behavior. Some definitions and specifics are deferred to Section 4, where we derive analytic formulas for the expected market share and its variance in a random market. We highlight a key factor that naturally emerges from the structure of the model—a measure of ’objectiveness’ versus ’subjectiveness’ in choice behavior. Section 5 shows that a softmax choice rule can be integrated into the model with minimal effect on its statistics. Finally, Section 6 demonstrates that our results may be applicable to a larger class of decision problems, including non-linear classification methods. We provide an example from the classification of random symbols using a neural network. Some details and proofs are deferred to Appendix A and Appendix B. Appendix C explores the way alternatives separate the space of individual weights into segments. Appendix D presents initial results for deriving formulae for the distribution of market shares in a random market. Appendix E discusses some extensions into non-linear utility (see also [24]).

2. Linear Preference Model

Consider a market consisting of A alternatives. Each alternative is characterized by F numerical features. The population consists of I individuals, each of whom decides on one of the alternatives by maximizing a personalized linear utility function, which is a weighted combination of the F features [4,5]. For simplicity, we assume the following:
  • Each alternative a = 1 … A is characterized by various measurable features. The measurement vector of an alternative contains the measured values of all features for that alternative and is denoted as m ¯ a = ( m a 1 , … , m a F ) ∈ R F .
  • Each individual i = 1 … I has a unique linear utility function, which assigns a real value to each alternative. Weight vectors are denoted as ω ¯ i = ( ω i 1 , … , ω i F ) ∈ R F .
  • Information about the alternatives is complete. Every individual picks from the same pool of alternatives, using the same measurements. All individuals see the same measurements of all features. In particular, there is no missing or hidden information.
  • Individuals make their decision based only on the alternatives in the market, not based on choices of other individuals.
  • The perceived value (utility) of alternative a for individual i is,
    v i , a = ω ¯ i · m ¯ a = ∑ f = 1 F ω i f m a f .
  • Each individual is assumed to choose the alternative with the highest value to them, i.e., arg max a = 1 … A v i , a .
  • We assume independence across features and between weights and measurements. That is, for any f ≠ f ′ , ω i f and ω i f ′ are independent, as well as m a f and m a f ′ , and any weight is independent of any measurement.
As an example, consider an individual seeking to purchase a vehicle and comparing multiple cars. Every car is described by various comparable numerical features such as price, speed, color, size, number of seats, running on gas/electricity, time between refueling/recharging, off-road capability, etc. Attributes such as price and gas consumption are relatively objective; however, a wealthy individual may assign a lower weight on costs, yet still care about the frequency of having to refuel. Other attributes may be subjective, as different individuals will look for different properties.
Due to the linearity of the model, certain situations are excluded from the model, such as those where the result is a non-linear mix of different components. In particular, while an individual may strongly favor two properties, they may not work well together, resulting in their combination being detrimental or causing diminishing returns. Such considerations cannot be modeled by a linear utility function. Additional linear model assumptions may not hold in some realistic scenarios [25]. For example, the assumption of full and coherent information on measurements, and on the existence of alternatives, is clearly non-trivial [26,27]. Recent heterogeneous-choice models allow the available or considered choice set itself to vary across individuals [18,19]. This source of variation is excluded from our base model and could otherwise be confounded with preference heterogeneity when only aggregate choices are observed. In some cases, such details can be taken into account using virtual measurements and weights. For example, adding an identity-specific feature that equals 1 for a specific alternative and 0 otherwise, with a large negative weight for an individual who does not know the alternative exists. Such approaches may lead to overfitting [28,29]. Finally, measurements and weights may be correlated. Some correlations may be reduced by principal component analysis.
The model is expected to be the most appropriate when choices aggregate many moderately important features, but may be less applicable if a single hard constraint dominates. We discuss this limitation further in Section 7.2.2.

2.1. Market Share

The market share of an alternative in a random market (i.e., random measurements and/or weights) is the average rate at which the alternative is chosen over the others. In other words, it is equal to the probability that a random individual i will pick alternative a out of all the available alternatives. There is an asymmetry within the structure of markets: when the number of individuals is large enough, due to the law of large numbers, adding more individuals does not change market shares as long as the underlying weight distributions remain the same. Adding new alternatives, on the other hand, adds competition to the existing alternatives, which reduces their total shares.
Often we will be interested in the market share of an alternative in a market where the rest of the alternatives are unknown. In such a case, the market share of alternative a can be defined as a random variable that, in the limit of I → ∞ , approaches the probability
T a ( m ¯ a , M a ) = P ω ¯ i ( v i , a > v i , a ′ , ∀ a ′ ≠ a | m ¯ a ) .
Here, M a is a matrix in which the columns are the measurement vectors from the market, aside from m ¯ a . In this notation, we think of m ¯ a as a fixed vector, i.e., the measurements of alternative a are known, but M a as random, i.e., the other measurements are random.

2.2. Market Types

To quantify the distinction between objective and subjective markets, we compare two components of the population’s preferences. The first is the shared component: the average direction in feature space toward which individuals tend to agree. It is given by the mean of a random weight vector, denoted as μ ¯ W . The second is the heterogeneity component: the amount by which individual preferences vary around this average direction, and is given by the standard deviation of a weight vector, denoted as σ ¯ W .
Definition 1.
Degree of subjectivity. The market’s degree of subjectivity is defined as η : = ‖ σ ¯ W ‖ / ‖ μ ¯ W ‖ . It ranges between zero for a fully objective market and infinity for a fully subjective market. It serves as a multivariate analogue to a coefficient of variation.
Intuitively, ‖ σ ¯ W ‖ ≪ ‖ μ ¯ W ‖ implies that there are a few features that dominate the selection, and that variance in preference is limited. Here, individuals mostly look for the same thing in an alternative, i.e., the market is objective. On the other hand, if ‖ σ ¯ W ‖ ≫ ‖ μ ¯ W ‖ , the variance is large compared to the mean, and it is expected that every individual will choose differently. Accordingly, we call the market subjective. The special case η = 1 will be shown to correspond to a competitive market, in which pairwise contests between random alternatives are maximally unpredictable. The surprising result is that as I , F → ∞ , the characterization of markets depends only on η .
To illustrate the meaning of the degree of subjectivity, consider the following analogy (equivalently, one may regard the varying daily conditions as playing the role of different realizations of individual preference). We come across a local chess club and learn that upsets do not happen frequently relative to the players’ Elo scores. If we pick two players at random to play many games, we can expect one of the pair to win most matches. This club corresponds to an objective market. In another club, a different chess opening is imposed each day, and different players specialize in different openings. If we pick two competitors at random, then on any given day one player may dominate their matches, but which player dominates depends strongly on the imposed opening. Across many randomly selected days, neither player has a systematic advantage. Such a club corresponds to a subjective market. Now consider a third club, somewhere between those two extremes. After picking two competitors at random, we observe their matches against one another over many randomly selected days. In this club, however, the eventual split of wins is maximally unpredictable. The proportion of games won by either player is uniformly distributed between 0 and 1 (for simplicity of the analogy, we ignore draws). Such a club reflects the maximal-entropy condition of a competitive market.
Definition 2.
Comparison distribution. Consider a simple market with only two alternatives, A = 2 . We refer to the distribution of the market share as a comparison distribution. As we will show later in the paper, this distribution reaches a stable limit as F → ∞ of the form
P ( T a < t ) = Φ η Φ − 1 ( t ) ,
where Φ is the cumulative distribution function (CDF) of the standard normal distribution.
Definition 3.
Comparison entropy. The comparison entropy of a market with A = 2 is defined as the differential entropy of its comparison distribution.
H = − E [ log c η ( T 1 ) ] ,
where c η is the probability density function (PDF) of the comparison distribution for a market with degree of subjectivity η. Note that the comparison distribution is symmetric around 1 / 2 , and there is no difference between choosing T 1 or T 2 here.
Definition 4.
Competitive market. A market is said to be competitive when its comparison entropy is maximal, which implies maximal uncertainty when comparing two alternatives at random.
In Section 4.6, we prove Equation (3) and show that in the limit I , F → ∞ , the comparison entropy depends only on η , i.e., the degree of subjectivity of the market. Moreover, a market is competitive exactly when η = 1 . In this paper, we do not make any claims about the connection between competitiveness in a preference market and existing measures of competitiveness in economic theory. It is not clear how, or in what capacity, being competitive affects a preference market—for example, if time dynamics or pricing were introduced to the model. We leave the reader only with the maximal-entropy condition as intuition behind the name.
Note that the definition for comparison distribution can be generalized to A > 2 by averaging the comparison distributions of all alternative pairs, thus enabling the same empirical analysis for larger markets.

3. Empirical Data and Simulations

In this section, we compare empirical data with simulations of the linear preference model. We do this in three ways. First, we demonstrate the behavior of simulated markets based on varying parameters, as well as different distribution types used for weights and measurements. Turning to real markets, we compare simulations of the linear model with example empirical market share data. Lastly, we look at empirical comparison distributions generated from full-ranking information, which is richer than knowing only the individual’s best alternative. The empirical results are summarized and sorted by comparison entropy in Table 1. Our goal is to demonstrate the applicability of the degree of subjectivity parameter η in describing the full market share distribution in real markets.
Table 1. Summary of empirical preference data, sorted by comparison entropy.
Simulating the preference decision process provides an intuitive understanding of the model’s output and its implications. By generating random weights, W ∈ R F × I , and measurements, M ∈ R F × A , the product W T M determines the empirical market share T a ( W , M ) , which can be used as an approximation for the non-empirical version when using a large value for I.
Figure 1 shows the rank-frequency graphs (which are also the empirical distributions of market share) of preference markets generated via different types of distributions. As shown below in Section 4.2, we can set μ M f = 0 and σ M f = 1 for all f. For simplicity, we use the same distribution for all weights and the same distribution for all measurements. The numerical results demonstrate the applicability of a central limit argument, establishing that when the number of features F is large, the market share distribution does not depend on the particular choice of distribution. Accordingly, for the rest of the paper simulations we will be using normal distributions for both weights and measurements.
Figure 1. Simulated random markets with uniform, normal, and log-normal distributions for both weights and measurements. (Left): a rank-frequency distribution corresponding to markets generated by a different distribution, with identical means and variances. (Right): the same data on a log–log scale.
Next, we analyze the distinction between objective and subjective decision problems within the model. A subjective problem can be thought of as one in which, for each individual who likes an aspect or element, there exists another individual who dislikes it as much. In terms of the model, we set μ W f = 0 for each f. Figure 2 shows the market share rank-frequency distribution that emerges in subjective and competitive markets, with varying market sizes. In subjective markets, the structure of rank-frequency distributions changes as the number of alternatives decreases, forcing individuals to select less preferred options. Conversely, when μ W f ≫ σ W f for all f, individual preferences converge to a shared value function ∑ f = 1 F μ W f m a f which would give rise to a single alternative getting the lion’s share of the market. In between these two extremes, we get a mixed decision problem with varying degrees of subjectivity. In contrast to subjective markets, markets that are more objective appear to retain their characteristic shape, even as the number of available alternatives decreases. When η = ‖ σ ¯ W ‖ / ‖ μ ¯ W ‖ = 1 , the market is competitive, which means the comparison entropy is maximized (see Section 4.6).
Figure 2. Rank-frequency plots for preference markets generated by simulation. The (first row) shows small markets at size A = 30 , while the (second row) shows larger markets with A = 1000 , showing only the top alternatives. (Left column): subjective markets, generated by setting η = ∞ . (Right column): competitive markets, generated by setting η = 1 . Smaller subjective markets have a distinct curvy shape, quite unlike their more objective counterparts.
Finally, we turn to study empirical examples of real markets. Finding static preference markets is challenging, as many real markets undergo certain dynamics that could influence the distribution of the measurement vectors in share-aware ways, which may not be possible to account for by a change in η alone.
Figure 3 shows comparisons of the rank frequency plots generated from population and election data in Israel, with the rank frequency plots of randomly generated preference markets using different degrees of subjectivity for each, fitted to the data by ad-hoc means of generating random markets using various values of η .
Figure 3. (Left): Israeli 2022 legislative election results (election data taken from https://votes25.bechirot.gov.il/ (accessed on 5 September 2025)) (blue), compared to a simulated random market with η = 2.3 (red). Higher η indicates a more subjective market. (Right): Israeli city population data (Population data taken from the Israeli Central Bureau of Statistics at https://www.cbs.gov.il/en (accessed on 5 September 2025)) from 2022 (blue, top 100 shown only), compared to a simulated random market with η = 1.3 (red).
Another source of data, which is more informative and sometimes easier to collect, comes from pairwise comparison polls. Figure 4 shows real data collected from online polls of various origins, alongside the approximate market share distribution in Equation (3). Higher values of η imply more subjective markets, while lower values are tied to objective markets.
Figure 4. Empirical comparison distributions formed by counting ratios of population splits in pairwise comparisons. The values of η were fit using a standard minimum Kolmogorov–Smirnov estimator. (A) Pairwise comparisons of joke rankings, including negative values. Part of the Jester data set [30] (https://goldberg.berkeley.edu/jester-data/ (accessed on 5 September 2025)). (B) Minneapolis mayoral elections from 2013, where a total of 35 candidates were voted for by ranked choice, (https://dataverse.harvard.edu/file.xhtml?fileId=11593264&version=25.0 (accessed on 5 September 2025)). (C) Elections generated by querying the 200 most listened to songs on Spotify, using their particular ratings in individual countries as a proxy for individual choosers (Preflib [31] dataset number 00047). (D) An experiment [32] conducted during the French presidential election of 2002, where voters engaged in approval voting could mark any number of candidates as a binary yes/no. For the purpose of comparison distribution, only cases where an individual marked one candidate as yes and another as no were taken into account (Preflib dataset number 00026).

4. Analytical Results

In this section, we derive the main analytical results. In particular, we provide a formula for the expected market share of an alternative in a random market.

4.1. Definitions

We start by properly defining the objects of study: preference markets and market shares.
Definition 5.
Random market. We define a market as a pair ( W , M ) , where W ∈ R F × I and M ∈ R F × A are random matrices containing all weights and measurements, respectively:
W = | | ω ¯ 1 … ω ¯ I | | , M = | | m ¯ 1 … m ¯ A | | .
The distribution of weight vectors is denoted as D W , and we assume that the individual weights are independent and identically distributed (IID). The marginal distributions are denoted ω i f ∼ D W f , having finite means and standard deviations μ W f and σ W f , respectively, for each f. Note that weights may be negative and do not necessarily sum to 1. The distribution of measurements is denoted by D M , and we assume that the measurement vectors of different alternatives are IID. The marginal distributions are denoted by m a f ∼ D M f , having finite means and standard deviations μ M f and σ M f , respectively, for each f.
Furthermore, we denote the domains of D W and D M by Ω W and Ω M , respectively. The distributions are both absolutely continuous with respect to the Lebesgue measures d P ( ω ¯ i ) and d P ( m ¯ a ) , respectively. Notice that these are distributions for a single vector, not a matrix (because they do not depend on i and a).
In addition to finite second moments, our high-dimensional market share approximations will require assuming some further mild conditions on higher moments, which roughly translate to ensuring that no single feature is solely responsible for a large portion of the decisions made. The model itself is defined regardless of these additional conditions, though it may appear more fruitful when they hold. For specifics, see Theorems A3 and A4, as well as the discussion in Section 7.2.2.
Definition 6.
Realized market. A realized market is a realization of M alone, but not W , i.e., W is still random. In other words, we know all the products in the market and their features. However, we do not know the particular individuals making their choices, only their statistics. We denote a realized market by M.
Below, we will also consider markets in which only one alternative, a, is realized, but not the rest of them (i.e., the measurements of all other alternatives are still random). For that, we may use a minor matrix, M a , which has alternative a omitted,
M a : = | | | | m ¯ 1 … m ¯ a − 1 m ¯ a + 1 … m ¯ A | | | | .
Definition 7.
Choice indicator. The choice indicator is a random variable defined as
c i , a ( W , M ) = 1 v i , a > v i , a ′ ∀ a ′ ≠ a 0 otherwise .
In other words, c i , a = 1 if alternative a is the best choice for individual i. The choice indicator is dependent both on individual i’s weights, ω ¯ i , and on the measurements of the entire market M . We assume that ∑ a = 1 A c i , a = 1 with probability 1, meaning there are no ties. This limits us to markets with at least one continuous measurement, but we may still apply the model if the probability of a tie is negligible.
Definition 8.
Market Share. The market share of alternative a in a random market ( W , M ) is the average rate at which the alternative is chosen over the others. In other words, it is equal to the probability that a random individual i will pick a out of all alternatives.
By realizing the weights as well as the measurements M = M , W = W , we can define the empirical market share of alternative a as
T a ( W , M ) : = 1 I ∑ i = 1 I c i , a ( W , M ) .
As the number of individuals I becomes large, the law of large numbers (LLN) applies, and using realized weights as opposed to a random variable becomes unnecessary. The (non-empirical) market share of alternative a is then provided by
T a ( M ) : = E W [ T a ( W , M ) ] = lim I → ∞ 1 I ∑ i = 1 I c i , a = P ω ¯ i ( v i , a > v i , a ′ , ∀ a ′ ≠ a | M ) .
Here, P X ( · ) and E X [ · ] denote the probability and expectation with respect to a random variable or vector X, respectively. Notice that in (9), the left-hand side (LHS) does not depend on i, while the right-hand side (RHS) does. This is because ω ¯ i are IID.
There is an asymmetry within the structure of markets: when the number of individuals is large enough, adding more individuals (and, thus, weight vectors) does not change market shares, as long as the underlying weight distributions remain the same. Adding new alternatives, on the other hand (and, therefore, new measurement vectors), adds competition to existing alternatives.
For a random market, the market share of a single realized alternative a in an otherwise random market is a random variable dependent on M a ,
T a ( m ¯ a , M a ) = P ω ¯ i ( v i , a > v i , a ′ , ∀ a ′ ≠ a | m ¯ a ) .
In this notation, we think of m ¯ a as a fixed vector, i.e., the measurements of alternative a are known, but M a is random, i.e., the other measurements are random.

4.2. Standardizing the Model Parameters

In order to reduce the degrees of freedom when defining a random market, we define and single out the preference order, which solely determines the market share.
Definition 9.
Preference order. The preference order of a realized market ( W , M ) is a distribution over permutation of length A, given by π σ = P ω ¯ i ( v i , σ 1 > v i , σ 2 > ⋯ > v i , σ A ) for every permutation σ ∈ S A .
Remark 1.
The marginal distributions, and in turn the preference order, fully determine market shares. Any change in the market that leaves the preference order unchanged will also leave market shares unchanged. This allows us to derive a standardized form for a market.
There are certain transformations one can apply to both weight and measurement vectors without changing the market’s preference order. For example, by multiplying either each weight ω i f or each measurement m a f by a constant C > 0 , or by multiplying all weights of a specific feature ω i f by a constant and dividing each corresponding measurement m a f by the same constant.
An interesting asymmetry arises when one tries to add a constant value to a specific feature’s weight or measure:
v i , a ′ = ∑ f = 1 F ( ω i f + C ) m a f = v i , a + C ∑ f = 1 F m a f ,
v i , a ′ = ∑ f = 1 F ω i f ( m a f + C ) = v i , a + C ∑ f = 1 F ω i f .
Since the first case depends on the alternative’s measurements m ¯ a , it could alter the preference order because it affects each alternative differently. The second case, however, depends only on the individual and therefore adds the same bias to the utility of all alternatives. Therefore, it does not affect the preference order.
Using these degrees of freedom, we can shift the distributions D W f and D M f such that μ M f = E [ m a f ] = 0 and σ M f 2 = E [ ( m a f ) 2 ] = 1 . This leaves us with one other degree of freedom, which we can use to normalize each weight vector. While this does not affect the preference order, it results in some loss of information on the relative contribution of features. Since, in this paper, we are mostly interested in the market share, unless stated explicitly, we will be working with normalized weights, ‖ ω ¯ i ‖ = 1 .
Due to the parameter standardization, we can write
‖ μ ¯ W ‖ = 1 1 + η 2 , ‖ σ ¯ W ‖ = η 1 + η 2 .

4.3. Expected Market Share

We proceed to calculate the expected market share of a specific alternative in a random market.
Recall that the random variable M a is a minor of the measurement matrix M created by omitting the column containing m ¯ a . As in Equation (10), we have
T a ( m ¯ a , M a ) = P ω ¯ i ( v i , a > v i , a ′ ∀ a ′ ≠ a | M ) .
If we condition over m ¯ a and take expectation over M a , we are left with a random variable over ω ¯ i :
E M a [ T a | m ¯ a ] = ∫ Ω M A − 1 P ω ¯ i ( ω ¯ i · m ¯ a > ω ¯ i · m ¯ a ′ ∀ a ′ ≠ a | M ) d P ( M a )   = ∫ Ω M A − 1 ∫ Ω W c i , a d P ( ω ¯ i ) d P ( M a ) .
Since the integrand is bounded, we can switch the order of integration as follows:
∫ Ω W ∫ Ω M A − 1 c i , a d P ( M a ) d P ( ω ¯ i ) = ∫ Ω W P M a ( ω ¯ i · m ¯ a > ω ¯ i · m ¯ a ′ ∀ a ′ ≠ a | ω ¯ i , m ¯ a ) d P ( ω ¯ i ) .
Since m ¯ a ′ are independent, this expression can be simplified to
∫ Ω W P m ¯ a ′ ( ω ¯ i · m ¯ a > ω ¯ i · m ¯ a ′ | ω ¯ i , m ¯ a ) A − 1 d P ( ω ¯ i ) .
Inside the parentheses we have F random variables ω i 1 m a ′ 1 … ω i F m a ′ F , each with mean 0 and variance ( ω i f ) 2 < ∞ . Under some mild conditions, the sum converges to a normal random variable. However, because we are looking to integrate over Ω W , the error might diminish impractically slowly. In order to bound this error, we need to show uniform convergence of ω ¯ i · m ¯ a ′ over Ω W , which we can achieve by employing the Berry–Esseen theorem. The full statement and proof can be found in Appendix B; here, we only state the following version, which we need in order to derive the expected value.
Theorem 1.
Assume that ∑ f = 1 F E [ | ω i f | 3 ] · E [ | m a ′ f | 3 ] → F → ∞ 0 and ∑ f = 1 F E [ ( ω i f ) 4 ] → F → ∞ 0 . Then, we have
lim F → ∞ ∫ Ω W P m ¯ a ′ ω ¯ i · m ¯ a ′ < ω ¯ i · m ¯ a | ω ¯ i A − 1 d P ( ω ¯ i ) − ∫ Ω W Φ ω ¯ i · m ¯ a A − 1 d P ( ω ¯ i ) = 0 ,
where Φ denotes the cumulative distribution function (CDF) of the standard normal distribution.
We now obtain
lim F → ∞ ∫ Ω W P m ¯ a ′ ( ω ¯ i · m ¯ a > ω ¯ i · m ¯ a ′ | ω ¯ i , m ¯ a ) A − 1 d P ( ω ¯ i ) = ∫ Ω W Φ ω ¯ i · m ¯ a A − 1 d P ( ω ¯ i ) .
We observe that the element within the CDF is yet another random vector dot product:
ω ¯ i · m ¯ a → d F → ∞ N ( μ ¯ W · m ¯ a , σ ¯ W 2 · m ¯ a 2 ) ,
where σ ¯ W 2 and m ¯ a 2 are provided by element-wise squaring of the original vector components. A proof of convergence in distribution can be found in Theorem A4. Assuming that σ ¯ W 2 · m ¯ a 2 does not vanish, we can change variables to obtain
E M a [ T a | m ¯ a ] ≈ 1 σ ¯ W 2 · m ¯ a 2 ∫ − ∞ ∞ Φ ( x ) A − 1 ϕ x − μ ¯ W · m ¯ a σ ¯ W 2 · m ¯ a 2 d x .
We leave to Section 7.2.2 the discussion of the practical implications of the moment assumptions we had to take for Theorem 1. Equation (A8) also provides a finite-dimensional diagnostic for the first Gaussian approximation. In our notation, its error is controlled by the term ∑ f = 1 F E [ | ω i f | 3 ] E [ | m a ′ f | 3 ] , together with the concentration of the weight-vector norm established in the proof. For moderate values of F, the error therefore depends on how quickly this term tends to zero. Figure 5 shows a comparison between the estimate and simulations. Here, we see our first motivation for normalizing the weights when we are only interested in the market share. Setting ‖ ω ¯ i ‖ = 1 does not change the preference order, and makes the use of A4 and A3 cleaner.
Figure 5. Comparison of the derived integral estimate of the expected market share and simulated data using normal distributions (top row) or log-normal distributions (lower row) for weights and measurements. (Left) Subjective market with η = ∞ . (Right) Competitive market with η = 1 . In both cases, we set F = 30 , m a f = 2 / F . In the log-normal case, the heavier tail in the distribution can cause the approximation to converge much slower.

4.4. Market Share Variance

We next consider the L’th moment of T a ( m ¯ a , M a ) .
E M a [ T a L | m ¯ a ] = ∫ Ω M A − 1 P ω ¯ i ( ω ¯ i · m ¯ a > ω ¯ i · m ¯ a ′ ∀ a ′ ≠ a | M ) L d P ( M a )   = ∫ Ω M A − 1 ∫ Ω W c i , a d P ( ω ¯ i ) L d P ( M a ) .
In order to switch the order of integration, we expand the power, each with an independent random weight vector:
∫ Ω W L ∫ Ω M A − 1 ∏ l = 1 L 1 { ω ¯ l · m ¯ a > ω ¯ l · m ¯ a ′ ∀ a ′ ≠ a } ( m ¯ a , M a ) d P ( M a ) ∏ l = 1 L d P ( ω ¯ l ) .
Each inner product ω ¯ l · m ¯ a ′ is again approximately normally distributed. However, unlike the L = 1 case, they are now dependent. As a result, we need to consider them together as a multivariate normal distribution. By replacing the order of integration and integrating over d P ( M a ) , we obtain
∫ Ω W L P m ¯ ( ω ¯ l · m ¯ a > ω ¯ l · m ¯ , ∀ 1 ≤ l ≤ L | m ¯ a ) A − 1 d P ( W ) ,
where
W = | | ω ¯ 1 … ω ¯ L | | ∈ R F × L .
Define x l : = ω ¯ l · ( m ¯ − m ¯ a ) , x ¯ = ( x 1 , … , x L ) . Recall that E [ m a f ] = 0 for all f. As F → ∞ , x ¯ → d N ( − W T m ¯ a , W T W ) . We can now write the L’th moment as
∫ Ω W L ∫ R − L exp ( − 1 2 ( x ¯ + W T m ¯ a ) T ( W T W ) − 1 ( x ¯ + W T m ¯ a ) ) ( 2 π ) L | W T W | d x ¯ A − 1 d P ( W ) .
This integral is difficult to evaluate in general. We proceed to calculate the second moment of the market share, which encompasses information about the risk of inserting a known alternative into an unknown market. Observe that, given mild conditions, each product ω ¯ l · ω ¯ l ′ is normal as well. Particularly, for the second moment, L = 2 , we have
z 1 z 2 z 3 : = ω ¯ 1 · m ¯ a ω ¯ 2 · m ¯ a ω ¯ 1 · ω ¯ 2 ∼ N μ ¯ 2 , Σ 2 ,
μ ¯ 2 = μ ¯ W · m ¯ a μ ¯ W · m ¯ a ‖ μ ¯ W ‖ 2 , Σ 2 = σ ¯ W 2 · m ¯ a 2 0 μ ¯ W · ( m ¯ a ⊙ σ ¯ W 2 ) 0 σ ¯ W 2 · m ¯ a 2 μ ¯ W · ( m ¯ a ⊙ σ ¯ W 2 ) μ ¯ W · ( m ¯ a ⊙ σ ¯ W 2 ) μ ¯ W · ( m ¯ a ⊙ σ ¯ W 2 ) ‖ σ ¯ W 2 ‖ 2 + 2 μ ¯ W 2 · σ ¯ W 2 ,
where ⊙ denotes element-wise vector product. By normalizing the weights, we obtain
W T W = 1 z 3 z 3 1 .
Substituting u ¯ = x ¯ + W T m ¯ a , the inner integral in (26) becomes
Φ 2 ( z 1 , z 2 , z 3 ) : = ∫ − ∞ z 1 ∫ − ∞ z 2 exp ( − 1 2 u ¯ T ( W T W ) − 1 u ¯ ) 2 π det ( W T W ) d u ¯ .
In other words, Φ 2 ( z 1 , z 2 , z 3 ) denotes the multivariate integral in two standard normal variables with a correlation coefficient of z 3 , evaluated with limits as seen in Equation (30). Finally, we use the multivariate PDF for z ¯ :
E [ T a 2 | m ¯ a ] = ∫ R 2 × ( − 1 , 1 ) exp ( − 1 2 ( z ¯ − μ ¯ 2 ) T Σ 2 − 1 ( z ¯ − μ ¯ 2 ) ) ( 2 π ) 3 det ( Σ 2 ) Φ 2 ( z 1 , z 2 , z 3 ) A − 1 d z ¯ ,
with μ ¯ 2 , Σ 2 presented above in (28).

4.5. Conditioned Market Share Expectation

In this section, we derive estimates for the expected market share of alternative a in a random market, when the alternative is conditioned in a way that gives us some partial information about its measurement vector.
For the rest of the section, we will be working with normalized weights and applying Theorem A3 to obtain ω ¯ i · m ¯ a | ω ¯ i ∼ N ( 0 , ‖ ω ¯ i ‖ 2 ) = N ( 0 , 1 ) . Note that, for a ≠ a ′ , we have cov ( ω ¯ i · m ¯ a , ω ¯ i · m ¯ a ′ | ω ¯ i ) = 0 . This implies that we can treat v i , a and each v i , a ′ as independent normal variables inside the integral. We begin with a simple sanity check by deriving the mean market share E M [ T a ] , which has to equal 1 / A due to symmetry:
E M [ T a ] = ∫ Ω W P M ( v i , a > v i , a ′ , ∀ a ′ ≠ a | ω ¯ i ) d P ( ω ¯ i ) ≈ ∫ − ∞ ∞ Φ ( x ) A − 1 ϕ ( x ) d x = 1 A .
Our strategy henceforth will be to impose some restriction on m ¯ a in the form of it belonging to an event R that has a non-zero measure, such that, given ω ¯ i and R, v i , a is normally distributed. Since cov M ( ω ¯ i · m ¯ a , ω ¯ i · m ¯ a ′ | ω ¯ i , R ) = 0 , we can solve for the market share expectation E M a [ T a | m ¯ a ∈ R ] as we did in Section 4.3. As in Theorem A4, some requirements on the moments are needed to ensure uniform convergence over Ω W .

4.5.1. Conditioning on the Norm of the Measurement Vector

Here, we investigate what we can tell about the market share of an alternative, knowing only the norm of its measurement vector. If the alternative stands out in some way, even one that is not universally appreciated, how would that affect its market share? Assume that in our market, the measurements are symmetric in the sense that E [ ( m a f ) 3 ] = 0 , and that we have an alternative m ¯ a with ‖ m ¯ a ‖ = r F for some r > 0 .
Consider ω ¯ i · m ¯ a | ω ¯ i ∼ N ( 0 , 1 ) and ‖ m ¯ a ‖ 2 ∼ N ( F , ∑ f = 1 F E [ ( m a f ) 4 ] − 1 ) as bivariate normal random variables. Their correlation is
cor ( ω ¯ i · m ¯ a | ω ¯ i , ‖ m ¯ a ‖ 2 ) = ∑ f = 1 F ω i f E [ ( m a f ) 3 ] ∑ f = 1 F E [ ( m a f ) 4 ] − 1 .
This is a random variable which is dependent on ω ¯ i . But since we are working with a symmetric market, it reduces to zero. Using the equations for bivariate normal variable conditioning,
ω ¯ i · m ¯ a | ω ¯ i , ‖ m ¯ a ‖ = r F ∼ N ( 0 , 1 ) .
At very large values of F, this limit does indeed hold, but a better approximation can be made using the law of large numbers (LLN) (in order to allow for the law of large numbers with our non identically generated E [ ( m a f ) 3 ] , we either need to assume additional mild conditions on the model generation (for example, independence of E [ ( ω i f ) 2 ] and E [ ( m a f ) 3 ] ), or use some special version of the LLN) to show that
var ( ω ¯ i · m ¯ a | ω ¯ i , ‖ m ¯ a ‖ = r F ) = ∑ f = 1 F ( ω i f ) 2 E [ ( m a f ) 2 | ‖ m ¯ a ‖ = r F ] → F → ∞ r 2 .
Using ω ¯ i · m ¯ a ∼ N ( 0 , r 2 ) we have
E M [ T a | ‖ m ¯ a ‖ = r F ] ≈ 1 r ∫ − ∞ ∞ Φ ( x ) A − 1 ϕ x r d x .
Or, alternatively,
E M [ T a | ‖ m ¯ a ‖ = r ] ≈ F r ∫ − ∞ ∞ Φ ( x ) A − 1 ϕ F x r d x .
Figure 6 demonstrates that the approximation is accurate when using a normal distribution for the measurements due to its zero skew.
Figure 6. A comparison of simulated data and the general estimate for the conditioned norm expected value E M [ T a | ‖ m ¯ a ‖ = F + 1 ] using normal distributions for weights and measurements (which is a symmetric distribution) and F = 30 .

4.5.2. Conditioning on the Value an Individual Assigns to an Alternative

We now consider another case where partial information is known about an alternative. Specifically, assume we have a single individual evaluate the information based on their preference (weight vector, denoted as u ¯ ), which is fully known. For simplicity, we take ‖ u ¯ ‖ = 1 . We are interested in the conditional expectation of the market share of alternative a given u ¯ · m ¯ a = v , E M [ T a | u ¯ · m ¯ a = v ] . The idea here is that we can split the product ω ¯ i · m ¯ a into the linear projection and rejection (which is the perpendicular component) of vector ω ¯ i onto u ¯ :
E M [ T a | u ¯ · m ¯ a = v ] = ∫ Ω W P ( ( proj u ¯ ω ¯ i + oproj u ¯ ω ¯ i ) · m ¯ a > ω ¯ i · m ¯ a ′ ∀ a ′ ≠ a | ω ¯ i ) d P ( ω ¯ i ) ,
where
proj u ¯ ω ¯ i = u ¯ · ω ¯ i ‖ u ¯ ‖ 2 u ¯ = ( u ¯ · ω ¯ i ) u ¯ , oproj u ¯ ω ¯ i = ω ¯ i − proj u ¯ ω ¯ i = ω ¯ i − ( u ¯ · ω ¯ i ) u ¯ .
Now, since the vectors are orthogonal, we write ‖ oproj u ¯ ω ¯ i ‖ = 1 − ( u ¯ · ω ¯ i ) 2 and notice that
cov ( proj u ¯ ω ¯ i · m ¯ a , oproj u ¯ ω ¯ i · m ¯ a | ω ¯ i ) = E ∑ f = 1 F m a f 2 ( proj u ¯ ω ¯ i ) f ( oproj u ¯ ω ¯ i ) f | ω ¯ i   = proj u ¯ ω ¯ i · oproj u ¯ ω ¯ i = 0 .
Hence, they are jointly normal. We can, therefore, write
( ω ¯ i · m ¯ a | ω ¯ i , u ¯ · m ¯ a = v ) ∼ N ( u ¯ · ω ¯ i ) v , 1 − ( u ¯ · ω ¯ i ) 2 .
In this case, the means and variances of the value distribution are dependent but still normal for a given weight vector. We can solve this by going directly to the integral (38):
∫ Ω W P ( ( u ¯ · ω ¯ i ) v + 1 − ( u ¯ · ω ¯ i ) 2 Z a > Z a ′ ∀ a ′ ≠ a ) d P ( ω ¯ i ) = ∫ Ω W 1 1 − ( u ¯ · ω ¯ i ) 2 ∫ − ∞ ∞ Φ ( x ) A − 1 ϕ x − ( u ¯ · ω ¯ i ) v 1 − ( u ¯ · ω ¯ i ) 2 d x d P ( ω ¯ i ) .
There are two specific cases we may be interested in:
  • The ‘information’ vector has a shape that will lead to u ¯ · ω ¯ i being distributed normally. This happens as long as the magnitude of the weights is not concentrated too much on a small subset of features.
  • The case where u ¯ = e f , a standard basis vector, which allows us to check the effect of an isolated feature and its measurement on the alternative’s market share.
In the first case, u ¯ · ω ¯ i ∼ N ( u ¯ · μ ¯ W , u ¯ 2 · σ ¯ W 2 ) . Therefore,
∫ − ∞ ∞ ∫ − 1 1 1 ( 1 − z 2 ) ( σ ¯ W 2 · u ¯ 2 ) ) Φ ( x ) A − 1 ϕ x − v z 1 − z 2 ϕ z − μ ¯ W · u ¯ σ ¯ W 2 · u ¯ 2 d z d x .
In the second case, we are going to need the distribution density function for ω i f , denoted as φ f ( z ) :
∫ − ∞ ∞ ∫ − 1 1 1 1 − z 2 Φ ( x ) A − 1 ϕ x − v z 1 − z 2 φ f ( z ) d z d x .
Figure 7 shows a comparison between simulations and approximations.
Figure 7. A comparison of simulated data and the estimate for the expected value of an alternative by conditioning on its subjective value for some test weight vector u ¯ . (Top): u ¯ was picked as a random Gaussian vector. (Bottom): u ¯ = e f , which is akin to singling out a measurement m a f and judging based on it alone. In both cases, F = 30 .

4.6. Distribution of Market Share

In this section, we derive a formula for the comparison distribution, which is the market share distribution of size A = 2 , and use it to calculate the comparison entropy. We also provide ad hoc bounds for the market share distribution of competitive markets.
Using the Gaussian approximation, finding a formula for P ( T a < t ) for A = 2 is relatively simple since there are only two alternatives to compare:
T a ( m ¯ a , m ¯ a ′ ) = P ( v i , a > v i , a ′ | m ¯ a , m ¯ a ′ ) = Φ μ ¯ W · ( m ¯ a − m ¯ a ′ ) σ ¯ W 2 · ( m ¯ a − m ¯ a ′ ) 2 .
Then,
P ( T a < t ) = P μ ¯ W · ( m ¯ a − m ¯ a ′ ) σ ¯ W 2 · ( m ¯ a − m ¯ a ′ ) 2 < Φ − 1 ( t ) = Φ η Φ − 1 ( t ) .
We can see that when the market is subjective, as in η = ‖ σ ¯ W ‖ / ‖ μ ¯ W ‖ → ∞ , the inner term will be close to − ∞ when t < 1 / 2 and + ∞ when t > 1 / 2 . This implies that as F → ∞ , the CDF approaches a step function at 1 / 2 . When η = 1 , Equation (46) simplifies into P ( T a < t ) = t , a uniform distribution, as can be seen in Figure 8.
Figure 8. CDFs of markets of size two. Insets show the segmentation of the market by chosen alternatives, where both alternatives and their respective segments are colored accordingly. Small dots represent individuals’ weight vectors, colored by their preferred alternative. Diamonds represent the alternatives. The boundary of each segment must go through the center of axes, which is marked with a plus. In a subjective market, two alternatives always segment the market into two parts going through the origin. As F → ∞ , the CDF of the subjective market distribution approaches a step function. In a competitive market with two alternatives, as F → ∞ , the distribution of market shares becomes uniform.
The fact that a market has a uniform distribution when comparing two alternatives is significant, as it implies that the competitive distribution maximizes the comparison entropy, which is how we originally defined the competitive distribution. In other words, a competitive market is one in which any two random alternatives segment the market in the least predictable way. From this fact, we draw the justification for calling it a competitive market.
Recall our definition of comparison entropy back in Section 2.2. In the context of the linear preference model, using Equation (46),
c η ( x ) = η ϕ η Φ − 1 ( x ) ϕ ( Φ − 1 ( x ) ) ,
H [ ( W , M ) ] = − ∫ 0 1 η ϕ η Φ − 1 ( x ) ϕ ( Φ − 1 ( x ) ) log η ϕ η Φ − 1 ( x ) ϕ ( Φ − 1 ( x ) ) d x .
Substituting z = Φ − 1 ( x ) ,
H [ ( W , M ) ] = − ∫ − ∞ ∞ η ϕ η z log η + log ϕ η z − log ( ϕ ( z ) ) d z = − log η + η 2 − 1 2 η 2 .
Maximizing ( 49 ) , we find that the maximal entropy distribution is obtained for η = 1 . Accordingly, this is our definition of a competitive market. This also follows on directly from the fact that the maximal entropy distribution among those defined on [ 0 , 1 ] is uniform when η = 1 .
Based on Equation (47), we can also derive a maximum-likelihood estimator for η . Given n pairwise comparisons where 0 < t i < 1 of the population choose one of the alternatives, one can easily find the MLE to be
η ^ = n ∑ i = 1 n Φ − 1 ( t i ) 2 .
Using the same simulation as above, we investigate the market share distribution for larger values of A (Figure 9). The competitive distribution appears to be similar in shape to an L p circle with p = A − 1 . This would provide a distribution of
P ( T a < t ) = ( 1 − ( 1 − t ) ( A − 1 ) 1 2 ) ( A − 1 ) − 1 2 .
Figure 9. Empirical cumulative distribution function of both subjective and competitive markets with A = 10 . For the competitive distribution, we provide two rough approximations. The true simulated value appears to be in between those two curves.
In fact, this approximation appears to work quite well as a lower bound (Figure 9), together with an upper bound provided by approximately
P ( T a < t ) = ( 1 − ( 1 − t ) ( A − 1 ) γ ) ( A − 1 ) − γ ,
where γ ≈ 0.5772 is the Euler–Mascheroni constant.

5. Imperfect Information and Softmax Choice

We now turn our attention to markets with incomplete information. We can model such markets by employing the softmax decision rule, instead of having individuals pick their best alternative with probability 1.
As shown in reference [14], multinomial logit choice probabilities arise from a random utility model in which each alternative is provided by U i , a = v i , a + ϵ i , a , where the ϵ i , a are i.i.d. type I extreme value (Gumbel) random variables. We can work that into our case by introducing choice probabilities:
P i ( a ) = e β v i , a ∑ a ′ = 1 A e β v i , a ′ ,
where 0 < β < ∞ is the inverse-temperatureparameter, which resembles the amount of information available in the market. In the limit β → ∞ , we obtain our original best-choice decision rule. As seen in reference [33], the noise term ϵ i , a follows a Gumbel distribution with zero location and scale 1 / β . We can roughly approximate it with a normal distribution of the same variance, center it (the mean of the noise does not affect choice probabilities), and use it to approximate η eff as a function of β :
v i , a + ϵ i , a ∼ N 0 , 1 + π 2 6 β 2 ,
η eff = ‖ σ ¯ W ‖ 2 + π 2 6 β 2 ‖ μ ¯ W ‖ = η 2 + π 2 ( 1 + η 2 ) 6 β 2 .
Figure 10 shows the rank frequencies and comparison distributions in markets using the softmax choice rule, as well as the same plots for markets using the best choice rule with a modified η eff . The market structure itself stays mostly intact, suggesting that adding noise to the market, for example, by means of faulty information, or lack thereof, can masquerade as an inherent higher degree of subjectivity (for discussion on similar ideas, see [34]).
Figure 10. (Left) Rank frequency plots generated using the softmax choice rule with η = 0.5 and a varying inverse-temperature β . (Right) Rank frequency plots averaged over many market realizations using the best value choice rule with the appropriate η eff . Small inconsistencies may arise due to approximating the Gumbel noise by the normal distribution. (Left inset): Comparison distribution CDF in each case. (Right inset): Log–log plot of the rank frequency plots.
This result suggests an underlying connection between systematic utility distributions generated by a linear preference model and the random utility theory framework presented in [12,15] and other works.
In Section 6, we discuss the model’s connection to neural networks and provide a short example of a preference market occurring in classification data in a natural manner. In Appendix C and Appendix D, we introduce market segmentation and present initial results in deriving a general formula for the market share distribution.

6. Relation to Classification Neural Networks

We present an example of a preference market arising naturally from a classification neural network by likening classification probabilities to utility. The purpose of this experiment is to compare theory with data and test the model predictions, specifically the importance of the parameter η with non-linear utilities.

6.1. Problem Setup

First, a neural network with multiple hidden layers was trained (the network received an input of a 28 × 28 grayscale image, which was processed through two convolutional blocks, followed by a flat dense layer and then a softmax layer with 47 elements for the various characters. It uses ReLU activations, dropout for regularization, and batch normalization to stabilize training) to classify images into English letters and digits; henceforth, characters using the extended MNIST dataset [35]. We then generated synthetic symbols using a custom Python (https://www.python.org/) script that draws random scribbles with varying structural complexity (the symbols were drawn using a turtle script [36] with two basic operations: draw a line in a random direction or draw a circle arc in a random direction, starting from the last position in both cases. Angles and lengths were picked out of configurable distributions, alongside probabilities to draw a straight line or an arc. The number of lines drawn was the only parameter to be changed between the three data sets, ranging from 1–2 in the “few lines” set to 5–7 in the “many lines” set), henceforth, symbols. These synthetic symbols were passed through the trained classifier to determine which label, or character, they most closely resembled. Figure 11 shows some of the characters and symbols, along with their classifications by the neural network.
Figure 11. (Left) Example characters from the MNIST extended dataset. Above each character, the digit/letter that the classifier assigns to it is displayed. (Right) Randomly generated symbols from three distinct sets with varying amounts of lines. (Top) Few lines. (Center) Medium lines. (Bottom) Many lines.
One can think of a decision process as a machine that takes an input describing an individual (weights) and uses them to pick one of the alternatives [28]. In the classification neural networks studied here, characters play the role of alternatives and symbols as weights. The relevant features and measurements for each alternative are found by training the network. The process of classification corresponds to choosing the most appropriate character. In fact, if the classification network were to be composed of only the first and last layers, it would result in the match probability being a monotone transformation (typically softmax) of a linear product, resulting in the same preference order as that of a linear utility.
Figure 12 shows the rank-frequency plots of random symbols in each set. Intuitively, different symbols with many lines are often interpreted as different characters, which is analogous to a subjective market. In contrast, with a smaller number of lines, most symbols are interpreted as ’1’, ’L’, or ’t’, leading to a more objective market.
Figure 12. Rank-frequency plots of the random symbols generated in each set. Each set was generated with the same configurations, aside from the number of lines drawn. The number of lines drawn ranges from 1–2 in the “few lines” set and 5–7 in the “many lines” set.

6.2. Comparison Distribution

Because the final layer of a classification network is a full vector of probabilities, we can compare any two characters and derive the empirical comparison distribution for the market (Figure 13). By minimizing the Kolmogorov–Smirnov statistic on the comparison distribution, we can estimate values of η as 0.81 ,   1.61 , and 2.32 for the respective data sets. Note that these estimates are only empirical, since the model is defined for linear utility, which digit classification is unlikely to represent. Still, not only do we see that the empirical comparison distribution is shaped mostly as we expect it to be in a linear preference market, but we can also observe how a larger number of lines in the symbol set leads to a higher value of η , as in a larger degree of subjectivity in the market.
Figure 13. Empirical comparison distribution for each symbol set in blue. In black, in the background, we have displayed a sample of some set values of η using Equation (46). The empirical comparison distribution was generated by creating a histogram from all possible pairs of alternatives (characters). For any given pair, we note the percentage of the population (symbols) that would pick one alternative over the other. We do this by comparing the respective values in the final vector of the neural network, i.e., the output layer, for each symbol. This gives rise to a distribution with symmetry around 1 / 2 , as the order of comparison does not matter.
In Section 7.3, we present an argument for why non-linear utility might still adhere to the shape of a linear preference model more often than expected.

7. Discussion

In this paper, we studied a high-dimensional probabilistic formulation of the linear multi-attribute utility model and investigated the statistical behavior of preference markets arising from it. While traditional approaches to MCDA typically emphasize the structure of individual utility functions and discrete choice modeling, our perspective shifts toward population-level outcomes.
To characterize the impact of variation in individual preferences, we introduced the parameter η = ‖ σ ¯ W ‖ / ‖ μ ¯ W ‖ , the degree of subjectivity in a market. Markets with η approaching zero exhibit largely objective behavior, where most individuals rank alternatives similarly. In contrast, when η is large, markets become highly subjective, and choice outcomes depend strongly on individual differences. Of particular interest is the case η = 1 , which defines a competitive market. There, the comparison distribution becomes uniform, indicating maximal entropy and minimal predictability: an emergent balance between consensus and variation.
We then derived analytical approximations for the expected market share of a fixed alternative in a random market, as well as for its variance and several forms of conditional expectations. These results support our main observation that the single parameter η classifies the distribution of market share among the alternatives.
Finally, we demonstrated the model’s applicability through a simulation involving randomly generated symbols and a trained neural network classifier. In this experiment, the neural network assigned labels to synthetic inputs, and the resulting distribution of classification outcomes naturally mirrored those of preference markets under the linear model. The similarity between empirical and simulated distributions suggests that the framework captures relevant features of high-dimensional decision processes and points to its potential use as a diagnostic tool in practical domains such as recommender systems, polling, and behavioral sciences.

7.1. Context and Repeated Surveying

Context is an important factor for preference. For example, asking individuals to pick their favorite fruit out of a list, which they may not have experienced in its entirety, could produce different results than first providing them with samples. In order to produce consistent and meaningful results when analyzing a number of decision-making processes, it is important that the context is consistent. This consistency is paramount for conducting a proper statistical analysis of preference, and while we took it for granted when defining the model, it is important to remember it is not trivial when working with real data and polls.
When the decision problem is consistent, each individual is met with the exact same scenario, and differences in individual preference alone cause differences in choice. The context can be thought of as an anchor, as discussed in [37].
An interesting idea is to transfer the implications of a change in context into a change in the individual’s preference. In theory, a probability distribution of contexts could then be transformed into a distribution of preference, the same as is possessed by the entire population (albeit being different parametrically).
One realization of this idea can be formed by conducting repeated surveys over time for a single individual, which may, in turn, approximate a cross-sectional survey under ergodicity assumptions.

7.2. Practical Limitations of the Model

7.2.1. Inherent Limitations of the Linear Preference Model

The most apparent limitation of modeling utility linearly is the inability to account for features that enhance or detract from one another. A fixed non-linear transformation of a single feature can be handled by transforming that measurement and its distribution (see Appendix E), but this does not account for interactions between features or individual-specific transformations (A simple example can be found in cooking: two ingredients may taste good separately, but not when mixed together). In Section 7.3, we provide an informal argument for how some non-linear utility functions may be represented using linear utility at the cost of introducing cross-weight correlations. Section 6 also presents one potentially non-linear case in which the empirical comparison distribution remained close to that predicted by the linear model. These observations suggest that the framework may remain useful in some non-linear settings, but we do not prove robustness to non-linear interactions or cross-weight correlations in this paper.
Aside from linearity, the model assumes complete and common information about the alternatives, decisions made independently by each individual, and an unlimited supply. Prices may be included as fixed measurements, but endogenous pricing, capacity constraints, and strategic or social interactions between decision-makers are not modeled. Section 5 relaxes deterministic choice by introducing random-utility noise through the softmax rule.
The model also describes a static market with a consistent context. In real markets, measurements, preferences, available alternatives, and consideration sets may change over time, while previous choices may themselves affect later decisions. Pooling observations across such changes can violate the assumed stability and independence of the underlying distributions. Context effects introduce a related limitation, discussed in Section 7.1: apparent differences in preference may instead reflect differences in how the same decision problem is presented or interpreted.

7.2.2. Limitations Arising from High-Dimensional Limit Assumptions

When deriving the equations for the expected market share in Theorem A3 (Appendix B), we had to take the assumption that
∑ f = 1 F E [ ( ω i f ) 4 ] ⟶ F → ∞ 0 ,
as well as
∑ f = 1 F E [ | ω i f | 3 ] · E [ | m a ′ f | 3 ] → F → ∞ 0 .
One of the major drawbacks of these conditions is that it becomes challenging to include distributions that are not sub-Gaussian.
The first condition essentially comes down to requiring that the magnitude of the weights is spread apart throughout the features and not clumped up too much in a small number of over-dominant features. It is also connected to the participation ratio of σ ¯ W 2 , defined as ‖ σ ¯ W ‖ 2 4 / ‖ σ ¯ W ‖ 4 4 in the case the vector’s elements are independent, and also sometimes referred to as the effective dimensionality of the vector. Indeed, since E [ ( ω i f ) 4 ] ≥ ( σ W f ) 4 , the first condition forces this effective dimension to diverge whenever the total variance stays bounded away from zero; the converse additionally requires control of the fourth moments. In some scenarios, we might find that while F itself is large, the effective dimensionality is the real limiter to the model’s applicability.
The second condition can be thought of as related to deal breakers. In order to fail, the condition would require some features whose weights and/or measurements are highly skewed.
For example, take food allergies as a deal breaker for an individual choosing a meal from a menu in a restaurant. For some individuals, the weight of the deal breaker or allergen will be extraordinarily large, which will invalidate, in a sense, the usual form of decision making.
Additionally, when measuring the expected market share for some given alternative with known measurements m ¯ a , we had to further assume that
sup F m ¯ a · μ ¯ W ( F ) m ¯ a 2 ( F ) · σ ¯ W 2 ( F ) < ∞
on our limit of F → ∞ . The implication of this is that the expected value estimate starts failing for superstar alternatives—if the value of the alternative is sufficiently above the typical range for the other alternatives, the approximation might fail. This could become relevant in regimes where the size of the market A is comparable to, or grows with, the size of the population I. In such regimes, such as the population of cities, the top alternatives’ values could approach such limits due to the laws of extreme-value theory. The error itself would vanish as F grows, but it raises a question about what if F itself grows as a function of I. Such regimes with many (with respect to I) alternatives are an interesting topic in and of themselves, but they remain outside the scope of this paper.

7.2.3. Limitations of Empirical Interpretation

Linear additivity, independence, moment conditions, and a sufficiently large effective dimension are mathematical limitations of the present theory, since they are used to derive the limiting market-share laws. Other limitations primarily affect empirical interpretation. Within the model, η measures preference heterogeneity relative to the shared component of preference. In observed choices, however, similar dispersion may arise from decision noise, incomplete information, limited consideration, changing context, or resource-limited information processing. Aggregate market shares alone do not generally distinguish between these mechanisms. An empirically fitted value of η should, therefore, be interpreted as a model-conditional description of the observed comparison distribution, rather than as identifying preference heterogeneity as its unique cause. Separating these explanations would require additional structure or data, such as repeated choices, controlled variation in menus or information, or direct measurements of the decision process.

7.3. Non-Linearity and Cross-Weight Correlations

Looking back at Figure 13, one might suspect there is more going on behind the scenes to allow for a non-linear problem to so closely align with a linear model. We provide a non-rigorous argument for how one can attempt to model any analytic utility function using a linear model, assuming that correlations between the weights are negligible.
The key idea here is that instead of viewing the weights of individuals as the input layer of a multi-layered classification network, we instead focus on the second-to-last layer. The move from that layer to the next final layer exactly encapsulates discrete choice based on linear utility and softmax, as in the Logit model. This leads to a couple of subtle implications.
  • In cases where the second-to-last layer is deep into the network, cross-weight correlations will be picked up along the network.
  • There is no guarantee that the distribution of the weights in the second-to-last layer produces a variance vector with high enough dimensionality (see the discussion in the previous Section 7.2.2), which is a necessary condition for the high-dimensional limit to hold properly. Utility, even when composed from a multitude of feature-weights, may end up having a low effective dimension of complexity.
  • The measurements become the edge weights of the neural network leading up to the final layer to each category (alternative). We may no longer be able to directly sample them, and the new measurements may be non-linear expressions of actual measurements.
In order to make sense of a preference market being generated directly for a utility function, we also require a concrete distribution on the alternatives, i.e., the neural network weights on the edges leading to the last layer. With that given, we are able to use PCA on the measurement space (modifying our new weights accordingly, further shifting their distribution), and finally, standardize the distributions as usual.
This leaves us with linear utility, but also with non-zero cross-weight correlations. As the non-linearity becomes ‘stronger’, one would expect the correlations to do so as well. Finally, we hypothesize that for linear models with low enough cross-weight correlations, one can bound the deviation from the correlation-free model we studied in this paper. This, however, is outside the scope of this paper and is left for future work to explore.

Author Contributions

O.P. and G.A. designed the research, performed the research, and wrote the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The data presented in this study are derived from resources publicly available in URLs provided in the body of the paper.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. Background: Definitions and Theorems

For completeness, we detail a few standard probability definitions and theorems [38].
Definition A1
(Convergence in distribution). We say that a sequence { X n } n = 1 ∞ of real-valued random variables with a cumulative distribution function (CDF) { F n ( x ) } n = 1 ∞ converges in distribution (or that it has a limit in distribution) to a random variable X with CDF F ( x ) and denote X n → d X if
lim n → ∞ F n ( x ) = F ( x )
at every point x ∈ R where the function F is continuous.
Definition A2
(Convergence in probability). We say that a sequence { X n } n = 1 ∞ of real-valued random variables converges in probability towards a random variable X, denoted X n → p X , if for all ε > 0 we have
lim n → ∞ P ( | X n − X | > ε ) = 0 .
Convergence in probability is a stronger condition than convergence in distribution.
Theorem A1
(Lyapunov condition Lindeberg triangular array central limit theorem). Let { X n , k } be a triangular array, independent within each row, with E [ X n , k ] = 0 and s n 2 = ∑ k var X n , k . If for some δ > 0 ,
1 s n 2 + δ ∑ k = 1 n E [ | X n , k | 2 + δ ] → n → ∞ 0 ,
then we have 1 s n ∑ k = 1 n X n , k → d N ( 0 , 1 ) .
Theorem A2
(Berry–Esseen non-uniform bound). Let X 1 , X 2 , … , X n be independent random variables with means E [ X i ] = 0 , variances Var ( X i ) = σ i 2 , and third absolute moments E [ | X i | 3 ] < ∞ . Define
s n 2 = ∑ i = 1 n σ i 2 , Z n = 1 s n ∑ i = 1 n X i .
Let Φ ( x ) denote the standard normal cumulative distribution function. Then, there exists a constant C > 0 such that for all x ∈ R ,
P ( Z n ≤ x ) − Φ ( x ) ≤ C 1 + | x | 3 1 s n 3 ∑ i = 1 n E [ | X i | 3 ] .
Lemma A1
(Multivariate normal probability density function). The probability density function for a multivariate normal variable X ∈ R d , X ∼ N ( μ ¯ , Σ ) is provided by
exp ( − 1 2 ( x ¯ − μ ¯ ) T Σ − 1 ( x ¯ − μ ¯ ) ) ( 2 π ) d det ( Σ ) .

Appendix B. Proof of Main Theorems

Theorem A3.
(Section 4.3 Equation (18)) Let X = ( X 1 , … , X K ) ∈ R K be a random vector with independent elements E [ X k ] = 0 and var ( X k ) = 1 . Let Y = ( Y 1 , … , Y K ) ∈ R K be a random vector with independent elements, generated independently of X, with E [ Y k ] = μ k and var ( Y k ) = σ k 2 . Assume that ∥ Y ∥ > 0 almost surely, and define the normalized vector as
Y ^ : = Y ∥ Y ∥ ∈ S K − 1 .
Suppose that ∥ μ ∥ 2 + ∥ σ ∥ 2 = 1 , ∑ k = 1 K E [ Y k 4 ] → 0 , and
∑ k = 1 K E [ | Y k | 3 ] E [ | X k | 3 ] ⟶ K → ∞ 0 .
Let f K : R K → R be a sequence of continuous functions. Then,
lim K → ∞ ∫ Ω Y P X f K ( Y ^ ) > X · Y ^ | Y = y d P ( Y ) − ∫ Ω Y Φ f K ( Y ^ ) d P ( Y ) = 0 ,
where Φ denotes the standard normal CDF.
Lemma A2.
Given the setting in Theorem A3, the following two conditions follow directly by applying Markov’s inequality:
1. 
∑ k = 1 K E [ | X k | 3 ] | Y k | 3 ⟶ p 0 ;
2. 
∑ k = 1 K | X k | 3 E [ | Y k | 3 ] ⟶ p 0 .
Proof of Theorem A3.
First, since
E [ ∥ Y ∥ 2 ] = ∑ k = 1 K μ k 2 + σ k 2 = 1 ,
and the elements of Y are independent, we have
var ( ∥ Y ∥ 2 ) = ∑ k = 1 K var ( Y k 2 ) ≤ ∑ k = 1 K E [ Y k 4 ] ⟶ 0 .
Therefore, ∥ Y ∥ 2 → p 1 ; hence, ∥ Y ∥ → p 1 . For every fixed realization Y = y , denote y ^ = y / ∥ y ∥ . The random variables X 1 y ^ 1 , … , X K y ^ K are independent, have mean zero, and their variances sum to ∑ k = 1 K y ^ k 2 = 1 . Using the Berry–Esseen bound, there exists a universal constant C such that
P X X · y ^ < f K ( y ^ ) − Φ f K ( y ^ ) ≤ C ∑ k = 1 K E [ | X k y ^ k | 3 ] 1 + | f K ( y ^ ) | 3 ≤ C ∥ y ∥ 3 ∑ k = 1 K | y k | 3 E [ | X k | 3 ] .
By Lemma A2, the sum on the right converges to zero in probability, while ∥ Y ∥ − 3 → p 1 . Therefore, the Berry–Esseen error converges to zero in probability. Since the error is bounded by 1, it also converges to zero in the mean. It follows that
∫ Ω Y P X X · Y ^ < f K ( Y ^ ) | Y = y d P ( Y ) − ∫ Ω Y Φ f K ( Y ^ ) d P ( Y ) ≤ ∫ Ω Y P X X · y ^ < f K ( y ^ ) − Φ f K ( y ^ ) d P ( y ) → K → ∞ 0 .
□
Corollary A1.
Under the same setup as in Theorem A3, given some Lipschitz function g : [ 0 , 1 ] → [ 0 , 1 ] , we have
lim K → ∞ ∫ Ω Y g P X X · Y ^ < f K ( Y ^ ) | Y = y d P ( Y ) − ∫ Ω Y g Φ f K ( Y ^ ) d P ( Y ) = 0 .
Indeed, if L is a Lipschitz constant of g, then
g P X ( X · y ^ < f K ( y ^ ) ) − g Φ ( f K ( y ^ ) ) ≤ L P X ( X · y ^ < f K ( y ^ ) ) − Φ ( f K ( y ^ ) ) ,
and the result follows from the proof of Theorem A3.
Theorem A4.
(Section 4.3 Equation (20)) Given the assumptions on Y in Theorem A3, let x ( K ) = ( x 1 , … , x K ) be a deterministic sequence, and denote s K 2 : = x 2 ( K ) · σ 2 ( K ) . Assume that, for some ε > 0 , s K 2 > ε for all sufficiently large K, and that
∑ k = 1 K | x k | 3 E [ | Y k | 3 ] ⟶ K → ∞ 0 .
Assume additionally that
sup K x ( K ) · μ ( K ) x 2 ( K ) · σ 2 ( K ) < ∞ .
Then,
x ( K ) · Y ^ ( K ) − x ( K ) · μ ( K ) x 2 ( K ) · σ 2 ( K ) ⟶ d N ( 0 , 1 )
as K → ∞ . Here, μ ( K ) = ( μ 1 , … , μ K ) , σ 2 ( K ) = ( σ 1 2 , … , σ K 2 ) , and x 2 ( K ) denotes the pointwise-squared vector of x ( K ) .
Proof of Theorem A4.
For readability, we omit ( K ) from all K-length vectors, although they still depend on K. We first establish convergence for the pre-normalized vector Y, whose elements are independent. Let s K 2 = x 2 · σ 2 . The random variables
x k ( Y k − μ k ) , k = 1 , … , K
are independent, have mean zero, and their variances sum to s K 2 . Using | a − b | 3 ≤ 4 ( | a | 3 + | b | 3 ) and Jensen’s inequality, | μ k | 3 ≤ E [ | Y k | 3 ] , we obtain
E [ | Y k − μ k | 3 ] ≤ 4 E [ | Y k | 3 ] + | μ k | 3 ≤ 8 E [ | Y k | 3 ] .
We can then check for the Lyapunov condition,
1 s K 3 ∑ k = 1 K E | x k ( Y k − μ k ) | 3 = 1 s K 3 ∑ k = 1 K | x k | 3 E [ | Y k − μ k | 3 ] ≤ 8 ε 3 / 2 ∑ k = 1 K | x k | 3 E [ | Y k | 3 ] ⟶ K → ∞ 0 .
The Lyapunov condition thus holds; hence,
Z K : = x · Y − x · μ s K ⟶ d N ( 0 , 1 ) .
As shown in the proof of Theorem A3, ∥ Y ∥ ⟶ p 1 . Since ∥ Y ∥ > 0 almost surely, it follows that ∥ Y ∥ − 1 → p 1 . Using Y ^ = Y / ∥ Y ∥ , we may write
x · Y ^ − x · μ s K = 1 ∥ Y ∥ x · Y − x · μ s K + x · μ s K 1 ∥ Y ∥ − 1 = 1 ∥ Y ∥ Z K + x · μ s K 1 ∥ Y ∥ − 1 .
By Slutsky’s theorem,
1 ∥ Y ∥ Z K ⟶ d N ( 0 , 1 ) .
Moreover, the sequence | x · μ | / s K is bounded by assumption, so
x · μ s K 1 ∥ Y ∥ − 1 ⟶ p 0 .
A second application of Slutsky’s theorem concludes the proof. □

Appendix C. Market Segmentation

Consider a realized market, i.e., all measurements, provided by a matrix M were drawn. For each weight vector w, we note the alternative that maximized the value. This defines a function from the space of weight vectors, R F , to { 1 … A } . The function separates (or segments) R F into disjoint regions according to its pre-image. In each region, all weight vectors share the same best alternative. The distribution of values within each region is not necessarily normal.
Figure A1. Segmentation of the weights-space R F by a market with three alternatives. Each alternative and its respective segment are colored accordingly. Small dots represent individuals’ weight vectors, colored by their preferred alternative. Diamonds represent the alternatives. The boundary of each segment must go through the center of axes, which is marked with a plus. For visual simplicity we choose F = 2 (two features). Regions are created by a set of linear conditions { ω ¯ i · m ¯ a > ω ¯ i · m ¯ a ′ } a ′ ≠ a , which result in polyhedral cones in R F whose boundaries pass through the origin.
Definition A3.
Segment. The segment of an alternative a in a realized market with measurements M is the set of all potential weight vectors that would prefer it over all others in the market,
S a ( M ) : = ω ¯ ∈ R F : ω ¯ · m ¯ a > ω ¯ · m ¯ a ′ ∀ a ′ ≠ a .
Note that the probability of a random weight vector being in the segment of alternative a is exactly its market share T a ( M ) , and ω ¯ i ∈ S a ( M ) ⇔ c i , a = 1 .
Definition A4.
Segmented values. The segmented value of an alternative in a realized market with measurements M is a random variable defined as the value an individual assigns to it, conditioned on the alternative being the individual’s best choice. More generally, we can define the value that an individual who picks alternative a ′ assigns to alternative aas
v i , a * a ′ : = ω ¯ i · m ¯ a for ω ¯ i ∈ S a ′ ( M ) .
Conditioning the same way over c i , a = 1 , we define the segmented weight means μ ¯ W ∗ a and segmented weight variances σ ¯ W ∗ a 2 as the vector means and variances of weight vectors in the segment of alternative a,
μ W ∗ a f = E ω ¯ i [ ω i f | M , c i , a = 1 ] , ( σ W ∗ a f ) 2 = var ω ¯ i ( ω i f | M , c i , a = 1 ) .
In any realized market with measurements M, we understand that
μ ¯ W = ∑ a = 1 A T a μ ¯ W ∗ a , σ ¯ W 2 = ∑ a = 1 A T a σ ¯ W ∗ a 2 + ∑ a = 1 A T a ( μ ¯ W ∗ a − μ ¯ W ) 2 .
In other words, the sum of segmented means weighted by market share has to equal the population-wide mean for the weight vectors, and similarly for the variance. Let us now observe the value gained by any one individual from the market as a random variable.
Definition A5.
Product and contribution. The contribution of alternative a is a random variable defined as λ i , a : = c i , a ω ¯ i · m ¯ a . The product of a market (market product as in the macro-economics definition of product, such as in the gross domestic product) is the sum of all the contributions, Λ i : = ∑ a = 1 A c i , a ω ¯ i · m ¯ a , and it is equal to the value provided by the best alternative for a random individual. Note that both product and contributions are dependent on both ω ¯ i and M . We define the mean and variance of the product in a realized market with measurements M as follows:
μ ^ ( M ) : = E ω ¯ i [ Λ i | M ] = E ω ¯ i ∑ a = 1 A c i , a ω ¯ i · m ¯ a | M , σ ^ 2 ( M ) : = var ω ¯ i ∑ a = 1 A c i , a ω ¯ i · m ¯ a | M .
The distribution of the market’s product is exactly a mixture distribution of the segmented value distributions from each alternative, or in other words, their contributions. We can express the mean and variance in terms of the segmented means and variances:
μ ^ ( M ) = ∑ a = 1 A T a m ¯ a · μ ¯ W ∗ a ,
σ ^ ( M ) 2 ≈ ∑ a = 1 A T a ( m ¯ a 2 · σ ¯ W ∗ a 2 ) + ∑ a = 1 A T a ( m ¯ a · μ ¯ W ∗ a ) 2 − μ ^ ( M ) 2 .
Note that the equation for the segmented variance is only an approximation, since conditioning weights on segments creates cross weight correlations.
In a random market,
E [ μ ^ ] = ∑ a = 1 A ∫ Ω M A ∫ Ω W c i , a · ω ¯ i · m ¯ a d P ( ω ¯ i ) d P ( M ) = A ∫ − ∞ ∞ Φ ( x ) A − 1 ϕ ( x ) x d x .
This value is exactly the expected value of the maximum between A independent standard normal variables. It grows roughly as 2 ln A [39].
Remark A1.
Λ i ( M ) is a mixture distribution of normal distributions.
Due to the segmentation of the market, Λ i ( M ) ∼ ∑ a = 1 A T a N ( m ¯ a · μ ¯ W ∗ a , m ¯ a 2 · σ ¯ W ∗ a 2 ) , a mixture distribution of approximately normal distributions. (We do not prove the claim that the contributions being normal in this paper; it is nontrivial due to cross-weight correlations in the segments. Figure A2 in the next appendix shows the distributions of market product and of individual contributions, and in practice they appear as approximately normal.) While not a concise proof, it hints that the market product itself will end up having approximately a normal distribution (with respect to ω ¯ i ), as we will see in Appendix D.

Appendix D. Deriving the Market Share Distribution

For a realized market, each value v i , a ′ = ω ¯ i · m ¯ a ′ is approximately normally distributed over Ω W , but not independent. If they were, however, we would be able to write a concise distribution for the maximal value for a random weight vector,
P ( max 1 ≤ a ≤ A v i , a < t ) = ∏ 1 ≤ a ≤ A Φ t − μ ¯ W · m ¯ a σ ¯ W 2 · m ¯ a 2 .
By comparing this expression with simulated data, we can see that it is fairly accurate even with dependence, as shown in Figure A2. This is justified by the fact that for a random market (which is just a randomly picked realized market),
E M cov ω ¯ i ( v i , a , v i , a ′ | M ) = E M σ ¯ W 2 · ( m ¯ a ⊙ m ¯ a ′ ) = 0 .
Zero expected covariance does not by itself imply zero correlation in a realized market. However, var ( v i , a | M ) = σ ¯ W 2 · m ¯ a 2 → p ‖ σ ¯ W ‖ 2 > 0 . It therefore remains to determine whether the covariance concentrates around zero as F → ∞ ,
var M cov ω ¯ i ( v i , a , v i , a ′ | M ) = E ( σ ¯ W 2 · ( m ¯ a ⊙ m ¯ a ′ ) ) 2 = ∑ f = 1 F ( σ W f ) 4 ,
where ⊙ denotes element-wise vector product. This is because any single factor of m a f or m a ′ f in the expanded expression cancelsout the term it is a part of, and, furthermore, E [ m a f 2 ] = 1 .
‖ σ ¯ W 2 ‖ 2 ‖ σ ¯ W ‖ 4 = ∑ f = 1 F ( σ W f ) 4 ∑ f = 1 F ( σ W f ) 2 2 .
If this ratio tends toward zero, Chebyshev’s inequality and Slutsky’s theorem imply that cor ω ¯ i ( v i , a , v i , a ′ ∣ M ) → p 0 . This ratio isthe inverse participation ratio (IPR) of the vector σ ¯ W that measures the degree to which its components are spread around equally. The requirement for a vector product or weighted sum to tend to a normal distribution as the vector length increases, is that the variance is spread out equally and not clumped up at any one value. This should coincide with the idea that σ ¯ W 2 is not concentrated at any specific feature, but instead spread out evenly across them, which implies that multiplying every element by itself greatly reduces the resulting sum. As we see in Figure A3, this value does not necessarily vanish as F → ∞ , but it remains relatively small.
Figure A2. Comparing the distribution of assigned values v i , a (shaded in colors) and the distribution of market product (shaded black). Two methods of approximating the product are displayed: a normal distribution fit and a product of the CDFs of the alternatives’ values.
Figure A3. (Left): Distribution of cor ( v i , a , v i , a ′ | M ) with respect to M , with F = 100 . (Right): Distribution of cor ( v i , a , Λ i | M ) . As we approach the limiting behavior of the number of features being large, we do not necessarily see the correlations approaching zero, which implies a standard concentration of measure argument is not available. However, weakly correlated normal variables are roughly independent.
Recall Remark A1, which led us to suspect that the distribution of the market product Λ i will have a normal distribution. If that were the case, and we were to show that cor ( ω ¯ i · m ¯ a , Λ i | M ) is small enough to treat these random variables as independent (which is what we observe in Figure A3), we would have
P ( T a < x ) ≈ ∫ Ω M A P Φ μ ¯ W · m ¯ A + 1 − μ ^ A σ ¯ W 2 · m ¯ A + 1 2 + σ ^ A 2 < x d P ( μ ^ A , σ ^ A 2 ) = ∫ Ω M A P μ ¯ W · m ¯ A + 1 − μ ^ A σ ¯ W 2 · m ¯ A + 1 2 + σ ^ A 2 < Φ − 1 ( x ) d P ( μ ^ A , σ ^ A 2 ) ,
where μ ^ A and σ ^ A 2 are the (random variables) market product mean and variance of a random market of size A. Using a similar argument as in Theorem A4, as F → ∞ we obtain
≈ ∫ Ω M A ∫ − ∞ ∞ 1 z − μ ^ A ‖ σ ¯ W ‖ 2 + σ ^ A 2 < Φ − 1 ( x ) ϕ ( z ‖ μ ¯ W ‖ ) ‖ μ ¯ W ‖ d z d P ( μ ^ A , σ ^ A 2 ) , = ∫ 0 ∞ ∫ − ∞ ∞ f μ ^ A , σ ^ A 2 ( μ ^ A , σ ^ A 2 ) Φ μ ^ A + ‖ σ ¯ W ‖ 2 + σ ^ A 2 Φ − 1 ( x ) ‖ μ ¯ W ‖ d μ ^ A d σ ^ A 2 ,
where f μ ^ A , σ ^ A 2 ( μ ^ A , σ ^ A 2 ) is the joint probability density function for the market product mean and variance (over Ω M A ). In theory, if each set of values ω ¯ i · m ¯ a and ω ¯ i · m ¯ a ′ were to be fully independent, then naturally the maximum of disjoint subsets would also be independent. However, since we are working with non-zero correlations, there might be a compounding error. For that reason, we need to observe the correlation between a single value that an individual may get from some alternative, v i , a and the maximal value it may get from all the alternatives in some market, Λ i , with respect to ω ¯ i . Then, like in the previous case, we look at the expected value and the variance of this variable with respect to M . Note that we do this calculation with a market of size A, which does not include alternative a, making a total of A + 1 alternatives.
cov ω ¯ i ( v i , a , Λ i | M ) = ∑ a ′ ≠ a cov ω ¯ i ( v i , a , λ i , a ′ | M ) .
cov ω ¯ i ( v i , a , λ i , a ′ | M ) = E ω ¯ i [ ( ω ¯ i · m ¯ a ) λ i , a ′ | M ] − E ω ¯ i [ ω ¯ i · m ¯ a | M ] E ω ¯ i [ λ i , a ′ | M ] .
It is simple to show that the expected value of this expression over M is zero. However, calculating the correlation is more difficult, and so is showing that the variance of the correlation is small enough for us to treat ω ¯ i · m ¯ a and Λ i as independent random variables. We will not be deriving a proof of this correlation being small in this paper, instead we only demonstrate it in simulations, as seen in Figure A3.

Appendix E. Measurement Space and Utility Space

In this appendix, we discuss the concept of a ’utility space’, wherein we can conceptually measure utility as a linear quantity. Assume there are some bijective maps φ f : M f → U f ⊆ R that translate each measurement into utility space U = ∏ f = 1 F U f ⊆ R F . Since the map is bijective, it is invertible, which implies monotonicity when continuous. Without loss of generality we take it to be monotonically increasing. The distribution of measurements then becomes P ( φ f ( m a f ) < x ) = P ( m a f < φ f − 1 ( x ) ) . This leaves us with a set of measurements that contribute to the total value in a linear manner, which relaxes the required assumption on linearity and independence to only having to assume that measurements are independent. For the sake of simplicity, we keep referring to measurements as m a f , even in utility space, as there is no particular reason to use the measurements before their projection into utility space.
Figure A4. Turning real measurable data into standardized utilities.
When working with real data, since the φ f are unknown, we might consider using a discrete measurement space, which is much easier to explore bijections on. For example, if M f = { 0 , 1 } and P ( x = 1 ) = p , we have
φ 2 , p ( x ) = 1 − p p x = 1 − p 1 − p x = 0 .
This function is well defined for each 0 < p < 1 and is unique under the assumptions that it is (monotonically) increasing E [ φ 2 , p ( x ) ] = 0 and var ( φ 2 , p ( x ) ) = 1 .

References

  1. Schwartz, B. The Paradox of Choice. In Positive Psychology in Practice; John Wiley & Sons, Ltd.: Hoboken, NJ, USA, 2015; Chapter 8; pp. 121–138. [Google Scholar] [CrossRef] [Scilit]
  2. Hess, S.; Daly, A. (Eds.) Handbook of Choice Modelling, 2nd ed.; Edward Elgar Publishing: Cheltenham, UK, 2024. [Google Scholar]
  3. Charness, G.; Gneezy, U. Portfolio Choice and Risk Attitudes: An Experiment. Econ. Inq. 2010, 48, 133–146. [Google Scholar] [CrossRef] [Scilit]
  4. Von Winterfeldt, D.; Fischer, G.W. Multi-Attribute Utility Theory: Models and Assessment Procedures. In Utility, Probability, and Human Decision Making: Selected Proceedings of an Interdisciplinary Research Conference, Rome, Italy, 3–6 September 1973; Wendt, D., Vlek, C., Eds.; Springer: Dordrecht, The Netherlands, 1975; pp. 47–85. [Google Scholar] [CrossRef] [Scilit]
  5. Dyer, J.S. Maut—Multiattribute Utility Theory. In Multiple Criteria Decision Analysis: State of the Art Surveys; Figueira, J., Greco, S., Ehrgott, M., Eds.; Springer: New York, NY, USA, 2005; pp. 265–292. [Google Scholar] [CrossRef] [Scilit]
  6. Ben-Akiva, M.; Mcfadden, D.; Abe, M.; Böckenholt, U.; Bolduc, D.; Gopinath, D.; Morikawa, T.; Ramaswamy, V.; Rao, V.; Revelt, D.; et al. Modeling Methods for Discrete Choice Analysis. Mark. Lett. 1997, 8, 273–286. [Google Scholar] [CrossRef] [Scilit]
  7. Berbeglia, G.; Garassino, A.; Vulcano, G. A Comparative Empirical Study of Discrete Choice Models in Retail Operations. Manag. Sci. 2022, 68, 4005–4023. [Google Scholar] [CrossRef] [Scilit]
  8. BuHamdan, S.; Alwisy, A.; Bouferguene, A.; Al-Hussein, M. The application of multi-attribute utility theory for a market share-based design evaluation. Int. J. Hous. Mark. Anal. 2019, 12, 985–1003. [Google Scholar] [CrossRef] [Scilit]
  9. Cegan, J.C.; Filion, A.M.; Keisler, J.M.; Linkov, I. Trends and applications of multi-criteria decision analysis in environmental sciences: Literature review. Environ. Syst. Decis. 2017, 37, 123–133. [Google Scholar] [CrossRef] [Scilit]
  10. Khan, I.; Pintelon, L.; Martin, H. The Application of Multicriteria Decision Analysis Methods in Health Care: A Literature Review. Med. Decis. Mak. 2022, 42, 262–274. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  11. Yannis, G.; Kopsacheili, A.; Dragomanovits, A.; Petraki, V. State-of-the-art review on multi-criteria decision-making in the transport sector. J. Traffic Transp. Eng. 2020, 7, 413–431. [Google Scholar] [CrossRef] [Scilit]
  12. McFadden, D.; Train, K. Mixed MNL Models for Discrete Response. J. Appl. Econom. 2000, 15, 447–470. [Google Scholar] [CrossRef]
  13. Azari Soufiani, H.; Parkes, D.C.; Xia, L. Random utility theory for social choice. Adv. Neural Inf. Process. Syst. 2012, 25, 126–134. [Google Scholar]
  14. McFadden, D. Conditional logit analysis of qualitative choice behavior. In Frontiers in Econometrics; Zarembka, P., Ed.; Academic Press: New York, NY, USA, 1974; pp. 105–142. [Google Scholar]
  15. Vij, A.; Krueger, R. Random taste heterogeneity in discrete choice models: Flexible nonparametric finite mixture distributions. Transp. Res. Part Methodol. 2017, 106, 76–101. [Google Scholar] [CrossRef] [Scilit]
  16. Evans, B.P.; Prokopenko, M. A Maximum Entropy Model of Bounded Rational Decision-Making with Prior Beliefs and Market Feedback. Entropy 2021, 23, 669. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  17. Lindig-León, C.; Kaur, N.; Braun, D.A. From Bayes-Optimal to Heuristic Decision-Making in a Two-Alternative Forced Choice Task with an Information-Theoretic Bounded Rationality Model. Front. Neurosci. 2022, 16, 906198. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  18. Barseghyan, L.; Coughlin, M.; Molinari, F.; Teitelbaum, J.C. Heterogeneous Choice Sets and Preferences. Econometrica 2021, 89, 2015–2048. [Google Scholar] [CrossRef] [Scilit]
  19. Aguiar, V.H.; Boccardi, M.J.; Kashaev, N.; Kim, J. Random Utility and Limited Consideration. Quant. Econ. 2023, 14, 71–116. [Google Scholar] [CrossRef] [Scilit]
  20. Zhao, Z.; Liu, A.; Xia, L. Learning Mixtures of Random Utility Models with Features from Incomplete Preferences. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22), Vienna, Austria, 23–29 July 2022; pp. 3780–3786. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  21. Salvadé, N.; Hillel, T. RUMBoost: Gradient Boosted Random Utility Models. Transp. Res. Part Emerg. Technol. 2025, 170, 104897. [Google Scholar] [CrossRef] [Scilit]
  22. Dalkılıç, O. Approaches That Take into Account Interactions between Parameters: Pure (Fuzzy) Soft Sets. Int. J. Comput. Math. 2022, 99, 1428–1437. [Google Scholar] [CrossRef] [Scilit]
  23. Dalkılıç, O.; Demirtaş, N. Similarity Measures of Neutrosophic Fuzzy Soft Set and Its Application to Decision Making. J. Exp. Theor. Artif. Intell. 2025, 37, 513–529. [Google Scholar] [CrossRef] [Scilit]
  24. Boj, E.; Grané, A. The robustification of distance-based linear models: Some proposals. Socio-Econ. Plan. Sci. 2024, 95, 101992. [Google Scholar] [CrossRef] [Scilit]
  25. Lopez-Persem, A.; Domenech, P.; Pessiglione, M. How prior preferences determine decision-making frames and biases in the human brain. eLife 2016, 5, e20317. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  26. Kivetz, R.; Simonson, I. The Effects of Incomplete Information on Consumer Choice. J. Mark. Res. 2000, 37, 427–448. [Google Scholar] [CrossRef] [Scilit]
  27. Lahdelma, R.; Salminen, P. Stochastic Multicriteria Acceptability Analysis (SMAA). In Trends in Multiple Criteria Decision Analysis; Ehrgott, M., Figueira, J.R., Greco, S., Eds.; Springer: Boston, MA, USA, 2010; pp. 285–315. [Google Scholar] [CrossRef] [Scilit]
  28. Arkoudi, I.; Krueger, R.; Azevedo, C.L.; Pereira, F.C. Combining discrete choice models and neural networks through embeddings: Formulation, interpretability and performance. Transp. Res. Part Methodol. 2023, 175, 102783. [Google Scholar] [CrossRef] [Scilit]
  29. Carrizosa, E.; Galvis Restrepo, M.; Romero Morales, D. On clustering categories of categorical predictors in generalized linear models. Expert Syst. Appl. 2021, 182, 115245. [Google Scholar] [CrossRef] [Scilit]
  30. Goldberg, K.; Roeder, T.; Gupta, D.; Perkins, C. Eigentaste: A Constant Time Collaborative Filtering Algorithm. Inf. Retr. 2001, 4, 133–151. [Google Scholar] [CrossRef] [Scilit]
  31. Mattei, N.; Walsh, T. PrefLib: A Library for Preferences HTTP://PREFLIB.ORG. In Proceedings of the 3rd International Conference on Algorithmic Decision Theory (ADT 2013); Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2013; Volume 8176, pp. 259–270. [Google Scholar] [CrossRef] [Scilit]
  32. Laslier, J.F.; Van der Straeten, K. A live experiment on approval voting. Exp. Econ. 2008, 11, 97–105. [Google Scholar] [CrossRef] [Scilit]
  33. Train, K.E. Discrete Choice Methods With Simulation, 2nd ed.; Cambridge University Press: Cambridge, UK, 2009. [Google Scholar] [CrossRef] [Scilit]
  34. Brown, G.D.A.; Walasek, L. Distinguishing Underlying, Inferred, and Expressed Preferences, Attitudes, and Beliefs: An Absence of (Mental) Flatness? Top. Cogn. Sci. 2025, 17, 681–712. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  35. Cohen, G.; Afshar, S.; Tapson, J.; van Schaik, A. EMNIST: An extension of MNIST to handwritten letters. arXiv 2017. Available online: http://arxiv.org/abs/1702.05373 (accessed on 5 September 2025).
  36. Python Software Foundation. Turtle 3.12—Turtle Graphics; Python Software Foundation: Beaverton, OR, USA, 2025. [Google Scholar]
  37. Kahneman, D. Reference points, anchors, norms, and mixed feelings. Organ. Behav. Hum. Decis. Process. 1992, 51, 296–312. [Google Scholar] [CrossRef] [Scilit]
  38. Durrett, R. Probability: Theory and Examples, 5th ed.; Cambridge University Press: Cambridge, UK, 2019. [Google Scholar]
  39. Kamath, G. Bounds on the Expectation of the Maximum of Samples from a Gaussian. 2015. Available online: http://www.gautamkamath.com/writings/gaussian_max.pdf (accessed on 5 September 2025).
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.