arXiv:2607. 09817v1 Announce Type: new Abstract: We propose a framework for the Markov chain (MC) choice model with panel data, including parameter estimation, personalized choice prediction, and personalized assortment optimization.
arXiv:2209. 04942v2 Announce Type: replace-cross Abstract: Problem definition: This paper studies the problem of estimating consumer preferences from bundle sales data.
arXiv:2606. 11118v1 Announce Type: new Abstract: We study a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers in a discrete-time setting.
arXiv:2608. 11419v1 Announce Type: new Abstract: Assortment optimization is a fundamental problem in revenue management, typically addressed using parametric choice models such as the multinomial logit (MNL) and its variants.
arXiv:2608. 12680v1 Announce Type: cross Abstract: Item demand forecasting is an integral component of store assortment optimization.
arXiv:2607. 13314v1 Announce Type: cross Abstract: Tabular foundation models (TFMs) generate predictions on structured data via in-context learning, without task-specific estimation.
arXiv:2603. 24705v3 Announce Type: replace-cross Abstract: Discrete choice models are fundamental tools in management science, economics, and marketing for understanding and predicting decision-making.
arXiv:2606. 16183v1 Announce Type: cross Abstract: We develop an LLM-powered virtual population model that simulates demand for pricing decisions, in settings where products are described by rich unstructured information, such as text descriptions and images, and where decision makers need not only mean-demand predictions but also uncertainty estimates for counterfactual prices.
arXiv:2507. 10834v4 Announce Type: replace Abstract: Assortment optimization seeks to select a subset of substitutable products, subject to constraints, to maximize expected revenue.
arXiv:2607. 11684v1 Announce Type: cross Abstract: Existing contextual multinomial logit (MNL) bandits model relevance-driven choice but ignore the potential benefits of within-assortment diversity, while submodular/combinatorial bandits encode diversity in rewards but lack structured choice probabilities.
arXiv:2407. 04900v2 Announce Type: replace Abstract: Numerous existing studies have examined the performance of Sample Average Approximation (SAA) in the fundamental newsvendor problem.
arXiv:2607. 25956v1 Announce Type: new Abstract: Multi-warehouse inventory allocation is typically formulated as a mixed-integer programming (MIP) problem, yet no single formulation consistently matches heterogeneous instance-level regimes induced by demand concentration, inventory imbalance, replenishment scale, service constraints, and forecast volatility.
arXiv:2604. 05845v2 Announce Type: replace-cross Abstract: Auto-bidding services optimize real-time bidding strategies for advertisers under key performance indicator (KPI) constraints such as target return on investment and budget.