Optimal Exploration of New Products under Assortment Decisions

• URL: http://arxiv.org/abs/2604.18800v1
• Date: Mon, 20 Apr 2026 20:08:46 GMT
• Title: Optimal Exploration of New Products under Assortment Decisions
• Abstract summary: We study online learning for new products on a platform that makes capacity-constrained assortment decisions.<n>We show that the optimal number of new products to explore simultaneously has a simple threshold structure.<n>Our results provide structural insights on how platforms should learn about new products through assortment decisions.
• Score: 3.5001922790927167
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study online learning for new products on a platform that makes capacity-constrained assortment decisions on which products to offer. For a newly listed product, its quality is initially unknown, and quality information propagates through social learning: when a customer purchases a new product and leaves a review, its quality is revealed to both the platform and future customers. Since reviews require purchases, the platform must feature new products in the assortment ("explore") to generate reviews to learn about new products. Such exploration is costly because customer demand for new products is lower than for incumbent products. We characterize the optimal assortments for exploration to minimize regret, addressing two questions. (1) Should the platform offer a new product alone or alongside incumbent products? The former maximizes the purchase probability of the new product but yields lower short-term revenue. Despite the lower purchase probability, we show it is always optimal to pair the new product with the top incumbent products. (2) With multiple new products, should the platform explore them simultaneously or one at a time? We show that the optimal number of new products to explore simultaneously has a simple threshold structure: it increases with the "potential" of the new products and, surprisingly, does not depend on their individual purchase probabilities. We also show that two canonical bandit algorithms, UCB and Thompson Sampling, both fail in this setting for opposite reasons: UCB over-explores while Thompson Sampling under-explores. Our results provide structural insights on how platforms should learn about new products through assortment decisions.

Related papers

• Overview of the TREC 2025 Product Search and Recommendation Track [56.17113795995271]
  We run a revised and continued version of the Product Search track previously run at TREC 2023 and TREC 2024.<n>The related-product recommendation task is particularly novel, providing an annotated data set of product relationships.<n>We anticipate the data from this track will enable better recommendation and search applications that reflect user needs, as a building block for conversational product discovery experiences.
  arXiv  Detail & Related papers  (2026-08-17T21:13:52Z)
• Exploring Query Understanding for Amazon Product Search [62.53282527112405]
  We study how query understanding-based ranking features influence the ranking process. We propose a query understanding-based multi-task learning framework for ranking. We present our studies and investigations using the real-world system on Amazon Search.
  arXiv  Detail & Related papers  (2024-08-05T03:33:11Z)
• ForeSeer: Product Aspect Forecasting Using Temporal Graph Embedding [25.421723193835895]
  Foreseer offers a novel framework for review forecasting by effectively integrating review text, product network, and temporal information. We evaluate ForeSeer on a real-world product review system containing 11,536,382 reviews and 11,000 products over 3 years.
  arXiv  Detail & Related papers  (2023-10-07T16:21:04Z)
• MMAPS: End-to-End Multi-Grained Multi-Modal Attribute-Aware Product Summarization [93.5217515566437]
  Multi-modal Product Summarization (MPS) aims to increase customers' desire to purchase by highlighting product characteristics. Existing MPS methods can produce promising results, but they still lack end-to-end product summarization. We propose an end-to-end multi-modal attribute-aware product summarization method (MMAPS) for generating high-quality product summaries in e-commerce.
  arXiv  Detail & Related papers  (2023-08-22T11:00:09Z)
• Product Ranking for Revenue Maximization with Multiple Purchases [29.15026863056805]
  We propose an optimal ranking policy when the online retailer can precisely model consumers' behaviors. We develop the Multiple-Purchase-with-Budget UCB algorithms with $O(sqrtT)$ regret. Experiments on both synthetic and semi-synthetic datasets prove the effectiveness of the proposed algorithms.
  arXiv  Detail & Related papers  (2022-10-15T11:59:45Z)
• OA-Mine: Open-World Attribute Mining for E-Commerce Products with Weak Supervision [93.26737878221073]
  We study the attribute mining problem in an open-world setting to extract novel attributes and their values. We propose a principled framework that first generates attribute value candidates and then groups them into clusters of attributes. Our model significantly outperforms strong baselines and can generalize to unseen attributes and product types.
  arXiv  Detail & Related papers  (2022-04-29T04:16:04Z)
• Personalized Entity Resolution with Dynamic Heterogeneous Knowledge Graph Representations [40.37976161857134]
  We propose a new framework that leverages personalized features to improve the accuracy of product ranking. We first build a cross-source heterogeneous knowledge graph from customer purchase history and product knowledge graph to jointly learn customer and product embeddings. After that, we incorporate product, customer, and history representations into a neural reranking model to predict which candidate is most likely to be purchased for a specific customer.
  arXiv  Detail & Related papers  (2021-04-06T16:58:27Z)
• User-Inspired Posterior Network for Recommendation Reason Generation [53.035224183349385]
  Recommendation reason generation plays a vital role in attracting customers' attention as well as improving user experience. We propose a user-inspired multi-source posterior transformer (MSPT), which induces the model reflecting the users' interests. Experimental results show that our model is superior to traditional generative models.
  arXiv  Detail & Related papers  (2021-02-16T02:08:52Z)
• Revenue Maximization and Learning in Products Ranking [6.35283128582654]
  We consider the revenue problem for an online retailer who plans to display in order a set of products differing in their prices and qualities.<n>Consumers have attention spans, i.e., the maximum number of products they are willing to view, and inspect the products sequentially before purchasing a product or leaving the platform empty-handed when the attention span gets exhausted.<n>Our framework extends the well-known model in two cascades: the consumers have random attention spans instead of fixed ones, and the firm maximizes revenues instead of clicking directions.
  arXiv  Detail & Related papers  (2020-12-07T15:41:57Z)
• A novel auction system for selecting advertisements in Real-Time bidding [68.8204255655161]
  Real-Time Bidding is a new Internet advertising system that has become very popular in recent years. We propose an alternative betting system with a new approach that not only considers the economic aspect but also other relevant factors for the functioning of the advertising system.
  arXiv  Detail & Related papers  (2020-10-22T18:36:41Z)
• Studying Product Competition Using Representation Learning [7.01269741110576]
  We introduce Product2Vec, a method based on the representation learning algorithm Word2Vec to study product-level competition. The proposed model takes shopping baskets as inputs and, for every product, generates a low-dimensional embedding that preserves important product information. We show that, compared with state-of-the-art models, our approach is faster, and can produce more accurate demand forecasts and price elasticities.
  arXiv  Detail & Related papers  (2020-05-21T00:36:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.