Bayesian Nonparametric Sequential Search

Sequential search models are popular in marketing for studying consumer search behavior. Current search models use parametric assumptions regarding different aspects of the models, such as random shocks, search costs, and consumer preferences. These assumptions can be restrictive. The authors develop a novel Bayesian nonparametric framework for sequential search to flexibly model unknown distributions. They also develop Markov chain Monte Carlo methods for inferring the model unknowns. The authors conduct simulation studies to demonstrate that currently popular parametric search models can yield incorrect estimates and inferences when the data-generating process deviates from their assumptions. In contrast, the proposed model accurately recovers these quantities for various data-generating processes. The methodology is then applied to online search and purchase data from a Japanese retailer. The results show that several heterogeneity distributions have complex patterns, such as multimodality and skewness, that are not captured by a parametric benchmark model. The authors also estimate the monetary value of search costs, the price elasticities, and a counterfactual profit gain under a personalized couponing strategy and find substantial differences in the results from the two models.

Authors

Publication Details

Journal
Journal of Marketing Research
Published
2024-08-09
DOI
https://doi.org/10.1177/00222437241274660
Citations
2
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.70
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bayesian Nonparametric Sequential Search

Asim Ansari, Kohei Onzo
2 citations
Journal of Marketing Research
Data Management and Algorithms
0.70
article

Bayesian Nonparametric Sequential Search

Asim Ansari, Kohei Onzo
article en
2 citations

Abstract

Sequential search models are popular in marketing for studying consumer search behavior. Current search models use parametric assumptions regarding different aspects of the models, such as random shocks, search costs, and consumer preferences. These assumptions can be restrictive. The authors develop a novel Bayesian nonparametric framework for sequential search to flexibly model unknown distributions. They also develop Markov chain Monte Carlo methods for inferring the model unknowns. The authors conduct simulation studies to demonstrate that currently popular parametric search models can yield incorrect estimates and inferences when the data-generating process deviates from their assumptions. In contrast, the proposed model accurately recovers these quantities for various data-generating processes. The methodology is then applied to online search and purchase data from a Japanese retailer. The results show that several heterogeneity distributions have complex patterns, such as multimodality and skewness, that are not captured by a parametric benchmark model. The authors also estimate the monetary value of search costs, the price elasticities, and a counterfactual profit gain under a personalized couponing strategy and find substantial differences in the results from the two models.

Journal of Marketing ResearchVol. 62(2)
Openalex Percentile: Top 33%
Data Management and Algorithms
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.