The multinomial probit (MNP) model extends binary probit to m≥3 unordered alternatives via a random utility framework. Each consumer h at time t assigns latent utility yh,t,j to alternative j and selects the alternative with highest utility; the choice indicators are generated from an underlying multivariate Normal distribution on the latent utilities, making the MNP the multinomial analogue of probit.
Key Ideas
Random utility structure: yh,t=Xh,tβh+εh,t, εh,t∼N(0,Λ), where yh,t is an m-vector of latent utilities and Ih,t=argmaxjyh,t,j is the observed choice.
IIA and its avoidance: a scalar (diagonal) covariance Λ=diag(1,λ2,…,λm) imposes the Independence of Irrelevant Alternatives (IIA) property; a full Λ or a correlated random coefficient distribution on βh breaks IIA without requiring a full m×m unrestricted correlation structure.
Identification: one utility scale normalization is required (λ1=1 set to the first alternative), plus a location normalization (utility differences, not levels, are identified); McCulloch-Rossi (1994) work in the space of utility differences.
Hierarchical random coefficients: in the marketing panel setting (Allenby-Rossi 1999), βh∼N(βˉ,Vβ) with conjugate priors on (βˉ,Vβ); the resulting hierarchical Bayes MNP (HB-MNP) delivers household-level posterior estimates π(βh∣data) as a by-product of the Gibbs chain.
How It Works
Data Augmentation (Albert-Chib 1993b, eqs. 19–21)
Augment with the full latent utility vector Zh,t∼Nm(Xh,tβh,Λ). The observed choice imposes Ih,t=j iff Zh,t,j>Zh,t,k for all k=j. The augmented Gibbs draws Zh,t by accept-reject: propose from Nm(Xh,tβh,Λ) and accept if the observed choice is the argmax. Efficiency degrades for large m.
McCulloch-Rossi (1994) Gibbs for the Hierarchical MNP
The six-block conditional structure for the Allenby-Rossi (1999) model (eqs. 11–16) draws successively from:
Ih,t∣yh,t — observed choice index (deterministic)
βˉ∣βˉˉ,aVβ — population mean (Normal, conjugate)
Vβ∣v0,V0 — population covariance (Inverse-Wishart, conjugate)
Λ∣ν,s — diagonal scale matrix (Inverse-Gamma per element, conjugate)
All blocks are conjugate; no Metropolis-Hastings (M-H) steps are needed for this specification.
Household-Level Inference
Individual posteriors emerge from marginalisation of the joint:
π(βh∣data)=∫π({βi},βˉ,Vβ∣data)dβ−hdβˉdVβ
computed by keeping Gibbs draws of βh and discarding the rest. Shrinkage toward the population mean βˉ is automatic: sparse households (few purchases) lean heavily on the prior; data-rich households are identified from their own observations.
Demographic Regression Mean (Rossi-McCulloch-Allenby 1996)
A direct extension of the McCulloch-Rossi Gibbs adds observable demographic covariates zh to the prior mean of βh:
βh=Δzh+vh,vh∼N(0,Vβ),h=1,…,H
where zh is a d×1 vector of demographics and Δ is a k×d matrix of regression coefficients. This allows brand preferences and price sensitivities to vary systematically with income, family size, retirement status, etc., in addition to unobserved heterogeneity captured by Vβ.
The Gibbs cycle gains one additional block: Δ∣{βh},Vβ,{zh} — a standard normal posterior from the multivariate regression. The resulting R2 decomposition reveals how much household variation is explained by demographics vs. unobservable sources (ρ2=1−Var(ϵ)/Var(β)). In the tuna dataset (Rossi-McCulloch-Allenby 1996), demographics explain only 7–33% of coefficient heterogeneity and just 7% of price sensitivity variation — the bulk is unobservable.
The practical implication for target marketing: demographic data alone yields only 12% incremental gain over blanket couponing, while even one purchase observation with causal variables yields 56%. See Rossi-McCulloch-Allenby (1996).
McCulloch-Polson-Rossi (2000) — ID Prior
The non-identified (NID) approach (McCulloch-Rossi 1994) places the prior on the full unidentified space and reports marginal posteriors of the identified parameters. The induced prior on the identified β is a χ2×Normal — heavy-tailed and awkward to assess informatively. The ID prior (McCulloch-Polson-Rossi 2000) places the prior directly on the identified space by fixing σ11=1 with probability one.
Reparameterisation: Partition ε=(U,Z′)′ and define γ=E(UZ), Φ=ΣZ−γγ′ (Schur complement). Then Σ=(1γγ′Φ+γγ′) and the one-to-one map allows:
γ∼N(γˉ,B−1),Φ−1∼W(κ,C)
Gibbs sampler (four blocks, all conjugate, no tuning parameters): β∼ Normal; Wij∼ truncated univariate Normal; γ∣Φ,β,{Wi}∼ Normal (regression of Z on U); Φ∣γ,β,{Wi}∼ inverted Wishart.
Prior assessment: For E(Σ)=I, the prior reduces to two scalars (κ,τ). Recommended default: κ=p+2, τ=1/8. Improper Φ prior is dangerous — analytically it is highly informative about the smallest eigenvalue of Σ (pushes it toward zero), causing sampler failure in high dimensions with little data.
Trade-off vs. NID: Informative priors on identified β are straightforward; hierarchical extensions βj∼N(βˉ,Vβ) apply naturally. Cost: higher chain autocorrelation. The Imai-van Dyk (2005) marginal augmentation approach later showed that the NID chain can be dramatically accelerated, partially closing this gap. See Imai-van Dyk (2005) and McCulloch-Polson-Rossi (2000).
Distinct from MNP (one choice among J alternatives), the multivariate probit (MVP) models J simultaneous binary outcomes Yi=(Yi1,…,YiJ)′ with Zi∼NJ(Xiβ,Σ) and Yij=I(zij>0). Σ must be in correlation form (unit diagonal) for identifiability.
Three-block Gibbs sampler (Chib-Greenberg 1998): (1) Zi∣yi,β,Σ — multivariate normal (MVN) truncated to Bi=∏jBij, sampled component-wise via J univariate truncated Normals (Geweke 1991); (2) β∣Z,Σ — conjugate Normal (eq. 6); (3) σ∣y,Z,β — M-H with tailored independence or reflection chain (eq. 7) using Newton-Raphson mode and inverse-Hessian covariance. For large J, the correlation parameters are partitioned into blocks updated sequentially. Marginal likelihood via the Chib (1995) identity extended with kernel density estimation for the σ ordinate.
Applications: Six Cities wheezing (n=537, J=4, equi-correlated vs. unrestricted vs. independent; Bayes factor (BF)2,3=4.63×1049); Panel Study of Income Dynamics (PSID) labour force participation (n=520, J=7, 21 free σ). The MVP framework for binary longitudinal data is the direct parent of Chib-Carlin (1999) Algorithms 5 and 7. See Chib-Greenberg (1998) and Gibbs Sampler.
Marginal Data Augmentation (Imai-van Dyk 2005)
The identification constraint σ11=1 makes the standard Gibbs cycle awkward. The unidentifiable scale α (defined by W~i=αWi for any α>0) creates a tension: fixing α slows mixing, but augmenting with it requires a prior that induces an interpretable distribution on the identifiable parameters.
The framework (Meng-van Dyk 1999): Define two strategies for using the working parameter α in a data-augmented sampler:
Conditional augmentation (Scheme 2): Fix α or condition on it when drawing W — the augmented-data model p(Y,W∣θ) is less diffuse, producing higher chain autocorrelation.
Marginal augmentation (Scheme 1): Average over a working prior for α before drawing W — p(Y,W∣θ) is more diffuse, improving the geometric rate of convergence. The Marginalization Strategy (Meng-van Dyk 1999) proves this can only improve convergence.
Under this framework:
McCulloch-Rossi (1994) uses Scheme 2 — that is why it is slower.
Nobile (1998) adds Step 4 that converts to Scheme 1 — that is why it helps; but it uses the same uninterpretable prior and has an error in the Metropolis acceptance probability R (substitutes (β~,Σ~) for (β,Σ)), distorting the stationary distribution by a factor of c−(2−k−p(p−1)/2).
McCulloch et al. (2000) fixes α, eliminating the unidentifiable parameter from the chain — Scheme 2 without the benefit of a diffuse augmented-data model; slowest.
New prior specification (Imai-van Dyk 2005):
β∼N(β0,A−1) directly on the identifiable β (A=0 allowed for flat prior)
p(Σ)∝∣Σ∣−(ν+p)/2[trace(SΣ−1)]−ν(p−1)/2 subject to σ11=1 — the distribution of Σ~/σ~11 where Σ~∼inv-Wishart(ν,S~)
Working prior: α2∣Σ∼α02trace(SΣ−1)/χν(p−1)2 (closed-form conjugate draw — no MH needed)
Algorithm 1 (Scheme 1) — three-step Gibbs with marginal augmentation:
For each i, draw Wi components via univariate truncated normals; then draw α2 from the working prior and set W~i=αWi (Scheme 1 marginalizes out α)
Draw (α2,β~)∣W~,Σ jointly (conjugate normal/chi-squared); set β=β~/α
Draw Σ~∣β~,W~∼inv-Wishart; set Σ=Σ~/σ~11 and Wi=W~i/σ~11
Algorithm 2 handles β0=0 via an alternative augmented-data model W~i=α(Wi−Xiβ); Algorithm 1 Scheme 1 is preferred when β0=0.
Empirical performance: Detergent data (6 brands, 2657 households) — Algorithm 1 converges in ~1000 draws vs. 60,000–80,000 for McCulloch-Rossi and Nobile (corrected) from a bad starting value; Dutch parliamentary elections (4 choices, 20 covariates) — Algorithm 1 Scheme 1 has clearly lower lag-100 autocorrelations than all competitors.
Avoids the IIA restriction of multinomial logit without requiring the (m−1)Th-dimensional integral of classical correlated probit maximum likelihood (eq. 19 in the paper).
Full Bayesian posterior over {βh} enables household-specific decision rules: optimal prices, targeted coupons, segment identification — all requiring nonlinear functions of parameters for which point estimates introduce overconfidence (Allenby-Rossi 1999, §4).
Continuous normal mixing distribution for βh outperforms finite mixture models: the finite mixture constrains individual posteriors to the convex hull of mass points, drastically understating tail heterogeneity; formal marginal log-likelihood (MLL) comparison on ketchup data (N=1401, 8191 purchases) gives Δlnp=2070 log-units in favour of HB.
Foundation for the broad class of hierarchical Bayes discrete-choice models now standard in quantitative marketing and applied microeconometrics.
Open Questions
The accept-reject draw for Zh,t degrades for large m (many alternatives). Later work develops more efficient multivariate truncated Normal samplers (Geweke 1991; Hajivassiliou-Ruud 1994 Geweke-Hajivassiliou-Keane (GHK) simulator).
The normal mixing distribution may be misspecified when heterogeneity is multimodal or heavy-tailed; McCulloch-Rossi (1996) introduce a mixture of normals for π(βh∣βˉ,Vβ) as a robustness check.
Scalability: with many alternatives and long panels, the draw of the latent utility matrix is computationally intensive; sparse data structures and parallel Gibbs chains are practical remedies.