Papers with Code 아카이브
Assortment Optimization
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
Assortment optimization is all about presenting the right mix of products in the right channels at the right time.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Learning an Optimal Assortment Policy under Observational Data
On Pareto Optimality for the Multinomial Logistic Bandit
Consumer Transactions Simulation through Generative Adversarial Networks
Outer Approximation and Super-modular Cuts for Constrained Assortment Optimization under Mixed-Logit Model
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization
Non-monotone Sequential Submodular Maximization
A Neural Network Based Choice Model for Assortment Optimization
A Model of Competitive Assortment Planning Algorithm
PASTA: Pessimistic Assortment Optimization
Consider or Choose? The Role and Power of Consideration Sets
Combinatorial Inference on the Optimal Assortment in Multinomial Logit Models
A Nonparametric Approach with Marginals for Modeling Consumer Choice
Identifying Substitute and Complementary Products for Assortment Optimization with Cleora Embeddings
Assortment Optimization with Customer Choice Modeling in a Crowdfunding Setting
The Limits of Personalization in Assortment Optimization
The Refined Assortment Optimization Problem
Adversarial Combinatorial Bandits with General Non-linear Reward Functions
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
Product age based demand forecast model for fashion retail
Uncertainty Quantification for Demand Prediction in Contextual Dynamic Pricing
Optimizing Revenue while showing Relevant Assortments at Scale
Assortment Optimization with Repeated Exposures and Product-dependent Patience Cost
A Generalized Markov Chain Model to Capture Dynamic Preferences and Choice Overload
Robust Dynamic Assortment Optimization in the Presence of Outlier Customers
Cascade Submodular Maximization: Question Selection and Sequencing in Online Personality Quiz
Dynamic Assortment Optimization with Changing Contextual Information
Continuous Assortment Optimization with Logit Choice Probabilities under Incomplete Information
Assortment Optimization under Unknown MultiNomial Logit Choice Models
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.