Author
Listed:
- Zhenyu Hu
(Department of Analytics & Operations, National University of Singapore Business School, National University of Singapore, Singapore 119245; and Institute of Operations Research and Analytics, National University of Singapore, Singapore 117602)
- Yangge Xiao
(Institute of Operations Research and Analytics, National University of Singapore, Singapore 117602)
Abstract
This paper investigates the seller’s revenue-maximizing mechanism in the face of a customer who searches for outside alternatives over a finite horizon. The customer’s utility from searches is modeled as a general function—referred to as the recall function—of the past search outcomes. Without observing the customer’s valuation of the product or any realization of search outcomes, the seller can propose and commit to a contract with the customer before the search process begins. Under a general recall function, we show that the optimal strategy for the seller is to offer a menu of American options consisting of deposits and strike prices. In the case in which the customer can only recall a few recent outside alternatives, we further establish that, under the optimal mechanism, customers with low valuation search for outside alternatives without engaging with the seller, whereas high-valuation customers exercise the option immediately, effectively turning the option into an exploding offer. Customers with intermediate valuation only exercise the option, if ever, at the end of the search horizon. Whereas a longer search horizon or smaller search cost both increase the customer’s utility from searches, they have different impacts on the seller’s revenue. More search opportunities lead to an exponential decrease in the seller’s revenue, and in the limit, the optimal mechanism converges to a posted price mechanism. In contrast, as the search cost increases, the seller’s revenue may initially decrease and then increase. In the extreme case in which the search cost exceeds the average value of outside alternatives, the customer’s sequential search problem reduces to strategically timing purchases of the seller’s product. Our optimal mechanism, in this case, reduces to making a single exploding offer with a monopoly price.
Suggested Citation
Zhenyu Hu & Yangge Xiao, 2025.
"Optimal Dynamic Mechanism Under Customer Search,"
Operations Research, INFORMS, vol. 73(4), pages 2045-2060, July.
Handle:
RePEc:inm:oropre:v:73:y:2025:i:4:p:2045-2060
DOI: 10.1287/opre.2022.0136
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:73:y:2025:i:4:p:2045-2060. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.