亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Ordering and Ranking Products for an Online Retailer

排名(信息检索) 业务 计量经济学 计算机科学 数学 情报检索
作者
Zijin Zhang,Hyun‐Soo Ahn,Lennart Baardman
出处
期刊:Social Science Research Network [Social Science Electronic Publishing]
标识
DOI:10.2139/ssrn.4061071
摘要

In e-commerce, product ranking and display affect customer choices and sales as items placed in top positions receive significantly more clicks than items placed at the bottom. For retailers who sell items from the inventory they have purchased and owned, product ranking has a profound impact on future demand as well as the amount of inventory to be ordered before the selling season starts. However, in many cases, inventory ordering and product ranking decisions are made separately at different times by different functional departments with little or no coordination. One of the main challenges is that the complexity of product ranking problem grows exponentially as the number of products on display increases. In this paper, we show that it is important to consider inventory ordering and product ranking decisions as a joint problem, and study how this can be done. In a problem where products are ordered and ranked only once, we show that the joint ordering-and-ranking problem can be reformulated into an easier assignment problem built on a sequence of newsvendor solutions, and thereby there exists a polynomial-time algorithm that generates an optimal ordering-and-ranking policy. We then consider a problem where product rankings can be updated over time, the above algorithm that uses static ranking is indeed asymptotically optimal. We also provide an algorithm with ranking updates, which performs better than the static ranking algorithm in both asymptotic and non-asymptotic settings. We next extend to the problem where a retailer utilizes pre-season sales (or pre-orders) to learn about future demand. Building on our analytic results, we propose a two-phase online learning algorithm with a theoretical performance guarantee. Using computational experiments, we show that our proposed algorithms significantly outperform benchmarks including the current split decision-making practices, can be scaled up to make ranking and ordering decisions with a large number of products, and generate high-quality solutions even when the underlying customer choice model is misspecified.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Ken关闭了Ken文献求助
刚刚
20秒前
af完成签到,获得积分10
40秒前
43秒前
在水一方完成签到,获得积分0
1分钟前
1分钟前
GPTea应助科研通管家采纳,获得20
1分钟前
GPTea应助科研通管家采纳,获得20
1分钟前
量子星尘发布了新的文献求助150
1分钟前
1分钟前
2分钟前
WerWu完成签到,获得积分10
3分钟前
3分钟前
Ken完成签到,获得积分10
3分钟前
余念安完成签到 ,获得积分10
3分钟前
3分钟前
所所应助科研通管家采纳,获得10
3分钟前
胡萝卜完成签到,获得积分10
4分钟前
bkagyin应助andrele采纳,获得10
4分钟前
andrele完成签到,获得积分10
4分钟前
4分钟前
4分钟前
橘子叶发布了新的文献求助10
4分钟前
邵硕发布了新的文献求助10
4分钟前
小呆完成签到 ,获得积分10
4分钟前
5分钟前
5分钟前
andrele发布了新的文献求助10
5分钟前
5分钟前
Criminology34应助邵硕采纳,获得10
5分钟前
情怀应助巴卡巴卡采纳,获得10
5分钟前
5分钟前
研友_VZG7GZ应助科研通管家采纳,获得10
5分钟前
巴卡巴卡发布了新的文献求助10
5分钟前
ding应助巴卡巴卡采纳,获得10
6分钟前
7分钟前
巴卡巴卡发布了新的文献求助10
7分钟前
7分钟前
7分钟前
大个应助干净的烧鹅采纳,获得10
7分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
《微型计算机》杂志2006年增刊 1600
Symbiosis: A Very Short Introduction 1500
Einführung in die Rechtsphilosophie und Rechtstheorie der Gegenwart 1500
Binary Alloy Phase Diagrams, 2nd Edition 1000
Air Transportation A Global Management Perspective 9th Edition 700
DESIGN GUIDE FOR SHIPBOARD AIRBORNE NOISE CONTROL 600
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 内科学 生物化学 物理 计算机科学 纳米技术 遗传学 基因 复合材料 化学工程 物理化学 病理 催化作用 免疫学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 4964996
求助须知:如何正确求助?哪些是违规求助? 4223823
关于积分的说明 13154796
捐赠科研通 4009288
什么是DOI,文献DOI怎么找? 2194334
邀请新用户注册赠送积分活动 1207910
关于科研通互助平台的介绍 1120856