Nested Pseudo-GMM Estimation of Demand for Differentiated Products

2026-02-04

AI Summary

This study addresses the high computational cost and poor scalability of generalized method of moments (GMM) estimation in the Berry–Levinsohn–Pakes (BLP) demand model when applied to markets with a large number of products. The authors propose a nested pseudo-GMM algorithm that reorders the GMM optimization and fixed-point iteration steps, fixing consumer-level outside-option probabilities to yield a closed-form, product-separable inversion from market shares to mean utilities. This approach introduces, for the first time, the nested pseudo-likelihood idea into the BLP framework, enabling analytical gradient computation, natural parallelization, and substantially reduced computational complexity. Monte Carlo simulations and empirical results demonstrate that the method achieves comparable estimation accuracy while significantly outperforming the fastest existing algorithms in speed, with superlinear acceleration gains as the number of products increases.

Technology Category

• Machine Learning: Bayesian Learning
• Search and Optimization: Mixed Discrete/Continuous Search
• Reasoning under Uncertainty: Stochastic Optimization

Application Category

• Economics, Online Markets and Human Computation: Cost models of using LLMs in production systems
• User Modeling, Personalization and Recommendation: Practical large-scale studies of user experience
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs

Abstract

We propose a fast algorithm for computing the GMM estimator in the BLP demand model (Berry, Levinsohn, and Pakes, 1995). Inspired by nested pseudo-likelihood methods for dynamic discrete choice models, our approach avoids repeatedly solving the inverse demand system by swapping the order of the GMM optimization and the fixed-point computation. We show that, by fixing consumer-level outside-option probabilities, BLP's market-share to mean-utility inversion becomes closed-form and, crucially, separable across products, yielding a nested pseudo-GMM algorithm with analytic gradients. The resulting estimator scales dramatically better with the number of products and is naturally suited for parallel and multithreaded implementation. In the inner loop, outside-option probabilities are treated as fixed objects while a pseudo-GMM criterion is minimized with respect to the structural parameters, substantially reducing computational cost. Monte Carlo simulations and an empirical application show that our method is significantly faster than the fastest existing alternatives, with efficiency gains that grow more than proportionally in the number of products.

Problem

• GMM estimation
• differentiated products demand
• BLP model
• computational efficiency
• inverse demand system

Innovation

• nested pseudo-GMM
• BLP demand model
• computational efficiency
• analytic gradients
• parallel implementation