Dynamic Probabilistic Selling When Customers Have Boundedly Rational Expectations

Tingliang Huang () and Zhe Yin ()
Additional contact information
Tingliang Huang: Business Analytics Department, Carroll School of Management, Boston College, Chestnut Hill, Massachusetts 02467
Zhe Yin: International Institute of Finance, School of Management, University of Science and Technology of China, Hefei, 230026 Anhui, China

Manufacturing & Service Operations Management, 2021, vol. 23, issue 6, 1597-1615

Abstract: Problem definition : The existing literature on probabilistic or opaque selling has largely focused on understanding why it is attractive to firms. In this paper, we intend to answer a follow-up question: How should opaque selling be managed in a firm’s operations over time? Academic/practical relevance : Answering this question is relevant yet complex, because in practice (i) the profitability of opaque selling depends on how customers respond to the firm’s product-offering strategies and (ii) the firm’s strategies have to be responsive to customers’ purchasing decisions to maximize its total profit. Methodology : We develop a simple game-theoretic framework to capture the dynamic nature of the problem in multiple periods when customers boundedly rationally expect the firm’s strategies through anecdotal reasoning. We characterize the firm’s optimal pricing and product-offering policy. Results : We find that offering the high-value product with a high probability followed by a lower probability is typically optimal over time. We finally analyze several model extensions, such as different numbers of customers, multiple anecdotes, infinitely many periods, and limited inventory, and show the robustness of our results. Managerial implications : We demonstrate the value of using a dynamic probabilistic selling policy and prove that our dynamic policy can double the firm’s profit compared with using the static policy proposed in the existing literature. In a dynamic programming model, we prove that a cycle policy oscillating between two product-offering probabilities is typically optimal in the steady state over infinitely many periods.

Keywords: probabilistic goods; opaque selling; bounded rationality; anecdotal reasoning; dynamic programming (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/msom.2020.0894 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormsom:v:23:y:2021:i:6:p:1597-1615

Access Statistics for this article

More articles in Manufacturing & Service Operations Management from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().