Optimizing Revenue while showing Relevant Assortments at Scale

03/06/2020
by   Theja Tulabandhula, et al.
0

Scalable real-time assortment optimization has become essential in e-commerce operations due to the need for personalization and the availability of a large variety of items. While this can be done when there are simplistic assortment choices to be made, imposing constraints on the collection of feasible assortments gives more flexibility to incorporate insights of store-managers and historically well-performing assortments. We design fast and flexible algorithms based on variations of binary search that find the revenue of the (approximately) optimal assortment. In particular, we revisit the problem of large-scale assortment optimization under the multinomial logit choice model without any assumptions on the structure of the feasible assortments. We speed up the comparisons steps using novel vector space embeddings, based on advances in the fields of information retrieval and machine learning. For an arbitrary collection of assortments, our algorithms can find a solution in time that is sub-linear in the number of assortments and for the simpler case of cardinality constraints - linear in the number of items (existing methods are quadratic or worse). Empirical validations using the Billion Prices dataset and several retail transaction datasets show that our algorithms are competitive even when the number of items is ∼ 10^5 (100x larger instances than previously studied).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2023

A note on solving the envy-free perfect matching problem with qualities of items

In the envy-free perfect matching problem, n items with unit supply are ...
research
06/28/2014

Efficient Learning in Large-Scale Combinatorial Semi-Bandits

A stochastic combinatorial semi-bandit is an online learning problem whe...
research
05/30/2020

Bi-Criteria Multiple Knapsack Problem with Grouped Items

The multiple knapsack problem with grouped items aims to maximize reward...
research
03/05/2023

Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale

The problem of packing equal circles in a circle is a classic and famous...
research
10/18/2016

Dynamic Assortment Personalization in High Dimensions

We study the problem of dynamic assortment personalization with large, h...
research
06/14/2021

Guaranteeing Half-Maximin Shares Under Cardinality Constraints

We study the problem of fair allocation of a set of indivisible items am...
research
11/04/2020

Maximizing Store Revenues using Tabu Search for Floor Space Optimization

Floor space optimization is a critical revenue management problem common...

Please sign up or login with your details

Forgot password? Click here to reset