Integrated Bundling and Pricing of Unique Items
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916382713577472 |
|---|---|
| author | Bouscary, Maxime Danaf, Mazen Amin, Saurabh |
| author_facet | Bouscary, Maxime Danaf, Mazen Amin, Saurabh |
| contents | Retailers have significant potential to improve recommendations through strategic bundling and pricing. By taking into account different types of customers and their purchasing decisions, retailers can better accommodate customer preferences and increase revenues while reducing unsold items. We consider a retailer seeking to maximize its expected revenue by selling unique and non-replenishable items over a finite horizon. The retailer may offer each item individually or as part of a bundle.
Our approach provides tractable bounds on expected revenue that are tailored to unique items and suitable for a rich class of choice models. We leverage these bounds to propose a bundling algorithm that efficiently selects bundles in a column-generation fashion. Under the multinomial logit model, our bounds are asymptotically optimal as the expected number of arrivals $λ$ grows, yielding a performance bound in $O(1/λ)$. In contrast, we show that both the static and fluid approximations are not asymptotically optimal. Moreover, we propose a greedy algorithm that allows for tractable dynamic bundling.
We show through numerical experiments that third-party logistics providers (3PL) in particular can benefit from improved load recommendations and pricing decisions. By not only minimizing shipping costs, but also reducing empty miles and suggesting options that better match carrier preferences, our methodology benefits digital brokerage platforms while contributing to the transportation industry's sustainability efforts. In a Texas Triangle simulation powered by Uber Freight data, dynamic bundling and pricing reduces costs by 6%, empty miles by 25%, and more than halves the number of unmatched loads over dynamic pricing alone. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14913 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Integrated Bundling and Pricing of Unique Items Bouscary, Maxime Danaf, Mazen Amin, Saurabh Optimization and Control Retailers have significant potential to improve recommendations through strategic bundling and pricing. By taking into account different types of customers and their purchasing decisions, retailers can better accommodate customer preferences and increase revenues while reducing unsold items. We consider a retailer seeking to maximize its expected revenue by selling unique and non-replenishable items over a finite horizon. The retailer may offer each item individually or as part of a bundle. Our approach provides tractable bounds on expected revenue that are tailored to unique items and suitable for a rich class of choice models. We leverage these bounds to propose a bundling algorithm that efficiently selects bundles in a column-generation fashion. Under the multinomial logit model, our bounds are asymptotically optimal as the expected number of arrivals $λ$ grows, yielding a performance bound in $O(1/λ)$. In contrast, we show that both the static and fluid approximations are not asymptotically optimal. Moreover, we propose a greedy algorithm that allows for tractable dynamic bundling. We show through numerical experiments that third-party logistics providers (3PL) in particular can benefit from improved load recommendations and pricing decisions. By not only minimizing shipping costs, but also reducing empty miles and suggesting options that better match carrier preferences, our methodology benefits digital brokerage platforms while contributing to the transportation industry's sustainability efforts. In a Texas Triangle simulation powered by Uber Freight data, dynamic bundling and pricing reduces costs by 6%, empty miles by 25%, and more than halves the number of unmatched loads over dynamic pricing alone. |
| title | Integrated Bundling and Pricing of Unique Items |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2408.14913 |