中文
相关论文

相关论文: Assortment Optimization under Unknown MultiNomial …

200 篇论文

In this paper, we study the assortment optimization problem under the mixed-logit customer choice model. While assortment optimization has been a major topic in revenue management for decades, the mixed-logit model is considered one of the…

最优化与控制 · 数学 2024-07-29 Hoang Giang Pham , Tien Mai

In this paper, we consider a multi-stage dynamic assortment optimization problem with multi-nomial choice modeling (MNL) under resource knapsack constraints. Given the current resource inventory levels, the retailer makes an assortment…

最优化与控制 · 数学 2025-11-05 Xi Chen , Mo Liu , Yining Wang , Yuan Zhou

In this paper we consider the problem of pricing multiple differentiated products. This is challenging as a price change in one product, not only changes the demand of that particular product, but also the demand for the other products. To…

最优化与控制 · 数学 2017-10-27 Ruben van de Geer , Sandjai Bhulai

Out of the rich family of generalized linear bandits, perhaps the most well studied ones are logisitc bandits that are used in problems with binary rewards: for instance, when the learner/agent tries to maximize the profit over a user that…

机器学习 · 计算机科学 2021-03-23 Sanae Amani , Christos Thrampoulidis

Crowdfunding, which is the act of raising funds from a large number of people's contributions, is among the most popular research topics in economic theory. Due to the fact that crowdfunding platforms (CFPs) have facilitated the process of…

数理金融 · 定量金融 2022-07-18 Fatemeh Nosrat

We study an online mixed discrete and continuous optimization problem where a decision maker interacts with an unknown environment for a number of $T$ rounds. At each round, the decision maker needs to first jointly choose a discrete and a…

最优化与控制 · 数学 2024-08-27 Lintao Ye , Ming Chi , Zhi-Wei Liu , Xiaoling Wang , Vijay Gupta

We study the multinomial logit (MNL) bandit problem, where at each time step, the seller offers an assortment of size at most $K$ from a pool of $N$ items, and the buyer purchases an item from the assortment according to a MNL choice model.…

机器学习 · 计算机科学 2020-11-20 Jiaqi Yang

In this paper, we study the joint product sequencing and pricing problem faced by many online retailers such as Amazon. We assume that consumers' purchase behavior can be explained by a ``consider-then-choose'' model: they first form a…

计算机科学与博弈论 · 计算机科学 2019-12-02 Shaojie Tang , Jing Yuan

When tracking user-specific online activities, each user's preference is revealed in the form of choices and comparisons. For example, a user's purchase history is a record of her choices, i.e. which item was chosen among a subset of…

机器学习 · 统计学 2019-01-01 Sahand Negahban , Sewoong Oh , Kiran K. Thekumparampil , Jiaming Xu

Multinomial logit bandit is a sequential subset selection problem which arises in many applications. In each round, the player selects a $K$-cardinality subset from $N$ candidate items, and receives a reward which is governed by a {\it…

机器学习 · 计算机科学 2019-03-05 Mingdong Ou , Nan Li , Shenghuo Zhu , Rong Jin

We consider an online assortment problem with $[n]:=\{1,2,\ldots,n\}$ sellers, each holding exactly one item $i\in[n]$ with initial inventory $c_i\in \mathbb{Z}_+$, and a sequence of homogeneous buyers arriving over a finite time horizon…

计算机科学与博弈论 · 计算机科学 2021-12-10 S. Rasoul Etesami

We study an assortment optimization problem under a multi-purchase choice model in which customers choose a bundle of up to one product from each of two product categories. Different bundles have different utilities and the bundle price is…

数据结构与算法 · 计算机科学 2022-10-12 Xin Chen , Jiachun Li , Menglong Li , Tiancheng Zhao , Yuan Zhou

We study online assortment optimization under stochastic choice when a decision maker simultaneously values cumulative revenue performance and the quality of post-hoc inference on revenue contrasts. We analyze a forced-exploration…

机器学习 · 统计学 2026-04-27 Jierui Zuo , Hanzhang Qin

In digital health and EdTech, recommendation systems face a significant challenge: users often choose impulsively, in ways that conflict with the platform's long-term payoffs. This misalignment makes it difficult to effectively learn to…

机器学习 · 计算机科学 2024-02-22 Arpit Agarwal , Rad Niazadeh , Prathamesh Patil

We study the assortment optimization problem under general linear constraints, where the customer choice behavior is captured by the Cross-Nested Logit model. In this problem, there is a set of products organized into multiple subsets (or…

最优化与控制 · 数学 2023-04-19 Cuong Le , Tien Mai

Motivated by modern-day applications such as Attended Home Delivery and Preference-based Group Scheduling, where decision makers wish to steer a large number of customers toward choosing the exact same alternative, we introduce a novel…

最优化与控制 · 数学 2025-02-13 Omar El Housni , Marouane Ibn Brahim , Danny Segev

The assortment problem in revenue management is the problem of deciding which subset of products to offer to consumers in order to maximise revenue. A simple and natural strategy is to select the best assortment out of all those that are…

数据结构与算法 · 计算机科学 2019-02-22 Gerardo Berbeglia , Gwenaël Joret

Motivated by applications in retail, online advertising, and cultural markets, this paper studies how to find the optimal assortment and positioning of products subject to a capacity constraint. We prove that the optimal assortment and…

数据结构与算法 · 计算机科学 2021-10-01 Andres Abeliuk , Gerardo Berbeglia , Manuel Cebrian , Pascal Van Hentenryck

We study the problem of pricing under a Multinomial Logit model where we incorporate network effects over the consumer's decisions. We analyse both cases, when sellers compete or collaborate. In particular, we pay special attention to the…

计算机科学与博弈论 · 计算机科学 2020-05-08 Felipe Maldonado , Gerardo Berbeglia , Pascal Van Hentenryck

We study the problem of modeling purchase of multiple products and utilizing it to display optimized recommendations for online retailers and e-commerce platforms. We present a parsimonious multi-purchase family of choice models called the…

信息检索 · 计算机科学 2023-08-08 Theja Tulabandhula , Deeksha Sinha , Saketh Reddy Karra , Prasoon Patidar