Assortment optimization for online video games

计算机科学 启发式 数学优化 多样性(控制论) 电子游戏 班级(哲学) 线性规划 芯(光纤) 收入 收益管理 最优化问题 方案(数学) 章节(排版) 消费者选择 非线性系统 工业工程 非线性规划 顾客满意度 博弈论 编码(内存) 总收入 动态规划 娱乐业 可扩展性
作者
Yunlong Wang,Fan You,Thomas Vossen,Rui Zhang
出处
期刊:Production and Operations Management [Wiley]
标识
DOI:10.1177/10591478261446056
摘要

We consider an assortment optimization problem for a class of online video games where the in-game virtual store has a unique structure with two sections: Featured and Just For You (JFY). All customers (players) are offered the same Featured section assortment, whereas the JFY section is used for personalized recommendations. We model customer choice under a constrained mixture-of-nested-logit model and propose different solution methods for the resulting assortment optimization problems. First, we introduce a novel mixed-integer nonlinear programming (MINLP) formulation. Numerical experiments show that the MINLP formulation generally obtains optimal solutions efficiently, using a variety of instances derived from conversations with our industry partner to mimic the environment found in their video game stores. In addition, we propose three approximate solution methods with theoretical performance guarantees: a fully polynomial time approximation scheme, a mixed-integer linear programming formulation, and a heuristic algorithm. To understand the impact of a shared Featured section, we analyze the distribution of display capacity between the Featured and JFY sections. Our numerical experiments highlight that the Featured section plays a critical role in balancing revenue and customer utility. To validate our use of a mixture-of-nested-logit model, we further conduct a simulation study based on ground-truth instances that are independent of the underlying structure of the consumer choice models we consider. The results indicate that our nested structure yields superior performance in terms of both capturing customer behavior and simulation revenue, compared with the mixture-of-multinomial logit model and the current practice of our industry partner. Overall, our paper is the first to study assortment optimization for the gaming industry under discrete choice models; it is also the first to devise both exact and approximate solution approaches for the constrained mixture-of-nested-logit model. Our results provide guidance for effective management of assortments in online video game stores and offer an “assortment” of solution approaches, allowing practitioners to choose one that best suits their environment.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
挽风风风风完成签到,获得积分10
刚刚
刚刚
lpls发布了新的文献求助10
1秒前
Jasper应助猫猫熊采纳,获得10
1秒前
1秒前
平常心发布了新的文献求助10
1秒前
幸运娃娃完成签到 ,获得积分10
1秒前
ryuuujin完成签到,获得积分20
2秒前
Dragon完成签到,获得积分10
2秒前
2秒前
嘻嘻发布了新的文献求助10
2秒前
feeuoo完成签到,获得积分10
3秒前
疯狂的寻绿完成签到,获得积分10
3秒前
3秒前
ZXW发布了新的文献求助10
3秒前
肉鸡完成签到,获得积分10
4秒前
Zhangyaocpusioc完成签到,获得积分10
4秒前
一曲终发布了新的文献求助10
4秒前
bo完成签到,获得积分10
4秒前
miaomiao123完成签到 ,获得积分10
4秒前
果子荆完成签到,获得积分10
6秒前
6秒前
子铭发布了新的文献求助10
6秒前
Fanbio完成签到,获得积分10
6秒前
XXk完成签到,获得积分10
6秒前
Zhusy完成签到 ,获得积分10
7秒前
病毒遗传学完成签到,获得积分10
7秒前
阔达宛凝完成签到,获得积分10
7秒前
隐形曼青应助Zhangyaocpusioc采纳,获得10
7秒前
7秒前
鸑鷟完成签到,获得积分10
8秒前
无情的聋五完成签到 ,获得积分10
8秒前
oyc完成签到,获得积分10
8秒前
9秒前
堇色完成签到,获得积分10
9秒前
feeuoo发布了新的文献求助10
9秒前
阿涼又困了完成签到,获得积分10
10秒前
10秒前
格子完成签到,获得积分10
11秒前
11秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Geist der Kunst und Kultur 1000
Social Psychology in the Real World 800
Resistance Spot Welding Dataset for Automobile Body-in-White Quality Analysis 748
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
Machine Learning for Asset Management and Pricing 600
Numerical analysis of the coupled atmosphere-ocean models (CAO II). II 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7410518
求助须知:如何正确求助?哪些是违规求助? 9014580
关于积分的说明 19199059
捐赠科研通 7042361
什么是DOI,文献DOI怎么找? 3233115
关于科研通互助平台的介绍 2395397
邀请新用户注册赠送积分活动 2215222