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]
被引量:1
标识
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
刚刚
英俊的铭应助Gyr060307采纳,获得10
刚刚
脑洞疼应助拾栖采纳,获得10
刚刚
2秒前
曼曼完成签到,获得积分10
2秒前
哈哈哈完成签到,获得积分10
4秒前
dangziutiu完成签到 ,获得积分0
4秒前
饱满梨愁应助小智采纳,获得10
4秒前
liputao完成签到 ,获得积分10
5秒前
5秒前
端庄的紫烟完成签到 ,获得积分10
5秒前
布里田完成签到 ,获得积分10
5秒前
火星上的柚子完成签到,获得积分10
5秒前
6秒前
jm关闭了jm文献求助
7秒前
哈哈哈发布了新的文献求助10
7秒前
沉静丹寒发布了新的文献求助10
7秒前
7秒前
顾矜应助suha采纳,获得10
8秒前
porcelainn123发布了新的文献求助10
8秒前
温婉的从阳完成签到,获得积分10
8秒前
9秒前
xuejingling应助66采纳,获得10
9秒前
Liu完成签到,获得积分10
9秒前
water完成签到,获得积分10
9秒前
10秒前
lyy66964193完成签到,获得积分10
11秒前
我是老大应助HJJHJH采纳,获得30
11秒前
廖其琪发布了新的文献求助10
12秒前
mayounaizi14完成签到,获得积分10
12秒前
Gyr060307发布了新的文献求助10
12秒前
一只特立独行的朱完成签到,获得积分10
14秒前
六神曲完成签到,获得积分10
15秒前
flora完成签到,获得积分10
16秒前
沉静丹寒完成签到,获得积分10
17秒前
迭影完成签到,获得积分10
18秒前
科研通AI6.4应助吃的采纳,获得30
20秒前
21秒前
YingjiaHu完成签到,获得积分10
21秒前
22秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
China Pluperfect I: Epistemology of Past and Outside in Chinese Art 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Cosmos as Art Object: Studies in Plato's Timaeus and Other Dialogues 500
What is the Future of Psychotherapy in Digital Age? Technology, AI Bots, and Psychotherapy after Covid 444
Management and the Arts 310
Teaching Social and Emotional Learning in Physical Education 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7634923
求助须知:如何正确求助?哪些是违规求助? 9208939
关于积分的说明 19750352
捐赠科研通 7202899
什么是DOI,文献DOI怎么找? 3275133
关于科研通互助平台的介绍 2436999
邀请新用户注册赠送积分活动 2272066