Optimal Sequencing in Single-Player Games

被引:2
|
作者
Li, Yifu [1 ]
Ryan, Christopher Thomas [2 ]
Sheng, Lifei [3 ]
机构
[1] Univ Sci & Technol China, Sch Management, Int Inst Finance, Hefei 230026, Anhui, Peoples R China
[2] Univ British Columbia, UBC Sauder Sch Business, Vancouver, BC V6T 1Z2, Canada
[3] Univ Houston Clear Lake, Coll Business, Houston, TX 77058 USA
基金
加拿大自然科学与工程研究理事会; 中国国家自然科学基金;
关键词
video games; level design; memory decay; adaptation; DESIGN; GAMIFICATION; SUSPENSE; SURPRISE;
D O I
10.1287/mnsc.2022.4665
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
An important problem in single-player video game design is how to sequence game elements within a level (or "chunk") of the game. Each element has two critical features: a reward (e.g., earning an item or being able to watch a cinematic) and a degree of difficulty (e.g., how much energy or focus is needed to interact with the game element). The latter property is a distinctive feature in video games. Unlike passive services (like a trip to the spa) or passive entertainment (like watching sports or movies), video games often require concerted effort to consume. We study how to sequence game elements to maximize overall experienced utility subject to the dynamics of adaptation to rewards and difficulty and memory decay. We find that the optimal design depends on the relationship between rewards and difficulty, leading to qualitatively different designs. For example, when the proportion of reward-to-difficulty is high, the optimal design mimics that of more passive experiences. By contrast, the optimal design of games with low reward-to-difficulty ratios resembles work-out routines with "warm-ups" and "cool-downs." Intermediate cases may follow the classical "mini-boss, end-boss" design where difficulty has two peaks. Numerical results reveal optimal designs with "waves" of reward and difficulty with multiple peaks. Level designs with multiple peaks of difficulty are ubiquitous in video games. In summary, this paper provides practical guidance to game designers on how to match the design of single-player games to the relationship between reward and difficulty inherent in their game's mechanics. Our model also has implications for other interactive services that share similarities with games, such as summer camps for children.
引用
下载
收藏
页码:6057 / 6075
页数:19
相关论文
共 50 条
  • [41] We have always been social: Comparing social expressiveness between single-player and multiplayer gamers
    Bergstrom, Kelly
    Poor, Nathaniel
    JOURNAL OF GAMING AND VIRTUAL WORLDS, 2023, 15 (03): : 247 - 266
  • [42] A single-player Monte Carlo tree search method combined with node importance for virtual network embedding
    Zheng, Guangcong
    Wang, Cong
    Shao, Weijie
    Yuan, Ying
    Tian, Zejie
    Peng, Sancheng
    Bashir, Ali Kashif
    Mumtaz, Shahid
    ANNALS OF TELECOMMUNICATIONS, 2021, 76 (5-6) : 297 - 312
  • [43] Measuring the level of difficulty in single player video games
    Aponte, Maria-Virginia
    Levieux, Guillaume
    Natkin, Stephane
    ENTERTAINMENT COMPUTING, 2011, 2 (04) : 205 - 213
  • [44] Scaling the Level of Difficulty in Single Player Video Games
    Aponte, Maria-Virginia
    Levieux, Guillaume
    Natkin, Stephane
    ENTERTAINMENT COMPUTING - ICEC 2009, 2009, 5709 : 24 - 35
  • [45] A single-player Monte Carlo tree search method combined with node importance for virtual network embedding
    Guangcong Zheng
    Cong Wang
    Weijie Shao
    Ying Yuan
    Zejie Tian
    Sancheng Peng
    Ali Kashif Bashir
    Shahid Mumtaz
    Annals of Telecommunications, 2021, 76 : 297 - 312
  • [46] Single-Player Universities in the South: The Role of University Actors in Development in Vietnam's North Central Coast Region
    Ramachandran, Leela
    Scott, Steffanie
    REGIONAL STUDIES, 2009, 43 (05) : 693 - 706
  • [47] OPTIMAL STRATEGIES IN 2-PLAYER STOCHASTIC DIFFERENTIAL-GAMES
    GAIDOV, SD
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1986, 39 (03): : 33 - 36
  • [48] Searching Optimal Movements in Multi-Player Games with Imperfect Information
    Yoshimura, Kenshi
    Llochin, Teruhisa
    Nomiya, Iliroki
    2016 IEEE/ACIS 15TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION SCIENCE (ICIS), 2016, : 795 - 800
  • [49] Computing uniformly optimal strategies in two-player stochastic games
    Eilon Solan
    Nicolas Vieille
    Economic Theory, 2010, 42 : 237 - 253
  • [50] Computing uniformly optimal strategies in two-player stochastic games
    Solan, Eilon
    Vieille, Nicolas
    ECONOMIC THEORY, 2010, 42 (01) : 237 - 253