Product Ranking on Online Platforms

排名(信息检索) 偏爱 订单(交换) 集合(抽象数据类型) 产品(数学) 计算机科学 经济盈余 消费者福利 秩(图论) 微观经济学 支付意愿 数学优化 选择集 经济 福利 运筹学 计量经济学 数学 机器学习 组合数学 财务 市场经济 几何学 程序设计语言
作者
Mahsa Derakhshan,Negin Golrezaei,Vahideh Manshadi,Vahab Mirrokni
出处
期刊: 卷期号:: 459-459 被引量:12
标识
DOI:10.1145/3391403.3399483
摘要

On online platforms, consumers face an abundance of options that are displayed in the form of a position ranking. Only products placed in the first few positions are readily accessible to the consumer, and she needs to exert effort to access more options. For such platforms, we develop a two-stage sequential search model where in the first stage, the consumer sequentially screens positions to observe the preference weight of the products placed in them and forms a consideration set. In the second stage, she observes the additional idiosyncratic utility that she can derive from each product and chooses the highest-utility product within her consideration set. For this model, we first characterize the optimal sequential search policy of a welfare-maximizing consumer. We then study how platforms with different objectives should rank products. We focus on two objectives: (i) maximizing the platform's market share and (ii) maximizing the consumer's welfare. Somewhat surprisingly, we show that ranking products in decreasing order of their preference weights does not necessarily maximize market share or consumer welfare. Such a ranking may shorten the consumer's consideration set due to the externality effect of high-positioned products on low-positioned ones, leading to insufficient screening. We then show that both problems---maximizing market share and maximizing consumer welfare---are NP-complete. We develop novel near-optimal polynomial-time ranking algorithms for each objective. Further, we show that even though ranking products in decreasing order of their preference weights is suboptimal, such a ranking enjoys strong performance guarantees for both objectives. We complement our theoretical developments with numerical studies using synthetic data in which we show (1) that heuristic versions of our algorithms that do not rely on model primitives perform well and (2) that our model can be effectively estimated using a maximum likelihood estimator.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
QDU的应助被dabai采纳,获得20
刚刚
李健的粉丝团团长的应助被gong采纳,获得10
刚刚
Juvenilesy的应助被长青采纳,获得20
刚刚
liney完成签到,获得积分10
刚刚
小包谷完成签到,获得积分10
1秒前
YPHCC发布了新的文献求助10
1秒前
徐臣年完成签到,获得积分10
1秒前
ludong_0完成签到,获得积分10
1秒前
小王完成签到 ,获得积分10
2秒前
852的应助被无忧小姐采纳,获得10
2秒前
自信南霜完成签到 ,获得积分10
2秒前
3秒前
3秒前
3秒前
3秒前
TQZZ完成签到,获得积分20
4秒前
呜呼啦呼完成签到,获得积分10
4秒前
碧蓝幼菱完成签到 ,获得积分10
5秒前
优雅的士萧完成签到,获得积分10
5秒前
十一完成签到,获得积分10
5秒前
耳喃发布了新的文献求助10
5秒前
5秒前
赘婿的应助被元儿采纳,获得30
6秒前
6秒前
白耀庭完成签到,获得积分10
6秒前
耍酷平凡完成签到,获得积分10
6秒前
凪启完成签到,获得积分10
6秒前
酒石酸完成签到,获得积分10
6秒前
6秒前
liney发布了新的文献求助10
7秒前
梓齊发布了新的文献求助10
7秒前
7秒前
7秒前
YPHCC发布了新的文献求助10
7秒前
凶狠的乐巧完成签到,获得积分10
7秒前
7秒前
立冬完成签到,获得积分10
8秒前
开心的白米饭完成签到,获得积分10
8秒前
赘婿的应助被向大闹闹采纳,获得10
8秒前
风吹麦浪发布了新的文献求助10
9秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
Social Psychology in the Real World 600
八旗制度の研究 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8180407
求助须知:如何正确求助?哪些是违规求助? 9570403
关于积分的说明 21811831
捐赠科研通 7776452
什么是DOI,文献DOI怎么找? 3433277
关于科研通互助平台的介绍 2557499
邀请新用户注册赠送积分活动 2479105