Matchmaking Strategies for Maximizing Player Engagement in Video Games

计算机科学 匹配(统计) 收入 用户参与度 动力学(音乐) 情感(语言学) 收益管理 人机交互 交战规则 钥匙(锁) 系统动力学 竞争优势 微观经济学 竞争分析
作者
Mingliu Chen,Adam N. Elmachtoub,Xiao Lei
出处
期刊:Management Science [Institute for Operations Research and the Management Sciences]
标识
DOI:10.1287/mnsc.2023.02957
摘要

Managing player engagement is vital to the online gaming industry, given that many games generate revenue through subscription models and microtransactions. We scrutinize engagement management in the prevalent category of competitive video games, where players are frequently matched against one another, and matchmaking systems substantially impact engagement. We propose a dynamic model to analyze player dynamics and optimize matchmaking policies for maximum engagement. Our model takes into account two essential factors in competitive games: heterogeneous skill levels and players’ aversion to losing. Additionally, the model enables us to consider pay-to-win strategies and AI-powered bots, which are contentious methods of influencing player engagement and endogenously affect the optimal matchmaking policy. To provide sharp insights, we analyze a specific case where there are two skill levels, and players churn only after experiencing a losing streak. The optimal matchmaking policy considers both short-term rewards by matching players myopically and long-term rewards by adjusting skill distribution. The pay-to-win system can positively impact player engagement when the majority of players are low-skilled, because adopting pay-to-win also affects skill distribution. This result challenges the conventional wisdom that typically regards pay-to-win as trading player experience for revenue. When incorporating AI-powered bots, we demonstrate that optimizing the matchmaking policy can significantly reduce the number of required bots. We then extend our model and conduct a case study with real data from an online chess platform. The optimal policy can improve engagement by 4%–6% or reduce the percentage of bots by 3% in comparison with skill-based matchmaking. This paper was accepted by Jeannette Song, operations management. Funding: A. N. Elmachtoub is partially supported by NSF [Grant CMMI-1944428]. X. Lei is partially supported by the Hong Kong Research Grants Council [Early Career Scheme 27503123]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2023.02957 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
鱼维尼完成签到,获得积分10
1秒前
ARNAMO完成签到,获得积分10
1秒前
2秒前
骆驼牛子发布了新的文献求助10
2秒前
LLL完成签到,获得积分10
2秒前
2秒前
我是天才完成签到,获得积分10
2秒前
英俊的铭应助Qinghua采纳,获得30
3秒前
情怀应助科研通管家采纳,获得10
3秒前
隐形曼青应助科研通管家采纳,获得30
3秒前
乐乐应助科研通管家采纳,获得10
3秒前
huang应助科研通管家采纳,获得10
3秒前
3秒前
动听心锁完成签到,获得积分10
3秒前
无极微光应助科研通管家采纳,获得20
3秒前
3秒前
3秒前
我是老大应助科研通管家采纳,获得10
3秒前
3秒前
香蕉觅云应助科研通管家采纳,获得10
4秒前
脑洞疼应助科研通管家采纳,获得10
4秒前
molihuakai应助科研通管家采纳,获得10
4秒前
852应助科研通管家采纳,获得10
4秒前
我是老大应助科研通管家采纳,获得10
4秒前
上官若男应助科研通管家采纳,获得10
4秒前
twob发布了新的文献求助10
4秒前
畸你太美发布了新的文献求助10
6秒前
852应助ding采纳,获得10
6秒前
852应助d叨叨鱼采纳,获得10
7秒前
慕青应助rrrrrr采纳,获得10
7秒前
水松完成签到 ,获得积分10
7秒前
espt完成签到,获得积分10
7秒前
7秒前
嘟嘟嘟发布了新的文献求助10
8秒前
常大有发布了新的文献求助10
8秒前
8秒前
CipherSage应助kangkang采纳,获得10
8秒前
WuzJ1ee完成签到,获得积分10
8秒前
Zhuangming发布了新的文献求助10
8秒前
骆驼牛子完成签到,获得积分10
8秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Molecular Mechanisms of Photosynthesis, 4th Edition 1000
Organic Reactions, Volume 116 1000
Matrix Methods in Data Mining and Pattern Recognition 510
Social Skills Improvement System-Rating Scales--Chinese Version 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7254586
求助须知:如何正确求助?哪些是违规求助? 8876687
关于积分的说明 18742738
捐赠科研通 6935086
什么是DOI,文献DOI怎么找? 3200159
关于科研通互助平台的介绍 2374831
邀请新用户注册赠送积分活动 2175117