paper-with-me

Papers

A Neural Network Based Choice Model for Assortment Optimization

2023-08-10 · Hanzhao Wang, Zhongze Cai, Xiaocheng Li, Kalyan Talluri

Discrete-choice models are used in economics, marketing and revenue management to predict customer purchase probabilities, say as a function of prices and other features of the offered assortment. While they have been shown to be expressive, capturing customer heterogeneity and behaviour, they are also hard to estimate, often based on many unobservables like utilities; and moreover, they still fail to capture many salient features of customer behaviour. A natural question then, given their success in other contexts, is if neural networks can eliminate the necessity of carefully building a context-dependent customer behaviour model and hand-coding and tuning the estimation. It is unclear however how one would incorporate assortment effects into such a neural network, and also how one would optimize the assortment with such a black-box generative model of choice probabilities. In this paper we investigate first whether a single neural network architecture can predict purchase probabilities for datasets from various contexts and generated under various models and assumptions. Next, we develop an assortment optimization formulation that is solvable by off-the-shelf integer programming solvers. We compare against a variety of benchmark discrete-choice models on simulated as well as real-world datasets, developing training tricks along the way to make the neural network prediction and subsequent optimization robust and comparable in performance to the alternates.

📄 PDF Abstract BibTeX arXiv:2308.05617

Code (0)

등록된 구현이 없습니다.

Tasks

Assortment OptimizationDiscrete Choice ModelsMarketing

Methods 이 논문이 사용한 방법론

fail 설명 없음

Similar Papers 제목 키워드 기반

PASTA: A Unified Framework for Offline Assortment Learning

2025-10-02 · Juncheng Dong, Weibin Mo, Zhengling Qi, Cong Shi 외 arxiv

We study a broad class of assortment optimization problems in an offline and data-driven setting. In such problems, a firm lacks prior knowledge of the underlying choice model, and aims to determine an optimal assortment…

PASTA: Pessimistic Assortment Optimization

2023-02-08 · Juncheng Dong, Weibin Mo, Zhengling Qi, Cong Shi 외

We consider a class of assortment optimization problems in an offline data-driven setting. A firm does not know the underlying customer choice model but has access to an offline dataset consisting of the historically off…

Assortment Optimization

Assortment Optimization under Unknown MultiNomial Logit Choice Models

2017-04-01 · Wang Chi Cheung, David Simchi-Levi

Motivated by e-commerce, we study the online assortment optimization problem. The seller offers an assortment, i.e. a subset of products, to each arriving customer, who then purchases one or no product from her offered a…

Assortment Optimization

Online Joint Assortment-Inventory Optimization under MNL Choices

2023-04-04 · Yong Liang, Xiaojie Mao, Shiyuan Wang

We study an online joint assortment-inventory optimization problem, in which we assume that the choice behavior of each customer follows the Multinomial Logit (MNL) choice model, and the attraction parameters are unknown…

Decision Making

Robust Assortment Optimization from Observational Data

2026-02-11 · Miao Lu, Yuxuan Han, Han Zhong, Zhengyuan Zhou 외 arxiv

Assortment optimization is a fundamental challenge in modern retail and recommendation systems, where the goal is to select a subset of products that maximizes expected revenue under complex customer choice behaviors. Wh…

Recommendation Systems