Reputation Systems for Non-Player Character Interactions Based on Player Actions

J. A. Brown, Jooyoung Lee, N. Kraev
{"title":"Reputation Systems for Non-Player Character Interactions Based on Player Actions","authors":"J. A. Brown, Jooyoung Lee, N. Kraev","doi":"10.1609/aiide.v13i1.12950","DOIUrl":null,"url":null,"abstract":"\n \n In digital games there is an emphasis on the idea of quest completion; by completing a quest the character wins resources from the giver of the quest, they also will gain a reputation among the Non-Player Characters (NPCs) for its completion. However, this reputation currently propagates across the game world in an unrealistic manner; many NPCs will know of a completion of a quest many townships over without a narrative rationale. In this paper, we examine a method for allowing NPC interactions to spread reputation in a game world from an initial witness point of a quest completion to all other NPCs. This model is examined in a series of connected graphs: size five models, small world graphs, and graphs developed from digital games. Tests show that propagation of the information is highly dependent upon easily established properties of interactions, such as the graph regularity, average degree, and diameter. Further, real game graphs demonstrate that information generated in high population hubs can be propagated faster than that generated in smaller quests from outlying areas.\n \n","PeriodicalId":92576,"journal":{"name":"Proceedings. AAAI Artificial Intelligence and Interactive Digital Entertainment Conference","volume":"63 1","pages":"151-157"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. AAAI Artificial Intelligence and Interactive Digital Entertainment Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1609/aiide.v13i1.12950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In digital games there is an emphasis on the idea of quest completion; by completing a quest the character wins resources from the giver of the quest, they also will gain a reputation among the Non-Player Characters (NPCs) for its completion. However, this reputation currently propagates across the game world in an unrealistic manner; many NPCs will know of a completion of a quest many townships over without a narrative rationale. In this paper, we examine a method for allowing NPC interactions to spread reputation in a game world from an initial witness point of a quest completion to all other NPCs. This model is examined in a series of connected graphs: size five models, small world graphs, and graphs developed from digital games. Tests show that propagation of the information is highly dependent upon easily established properties of interactions, such as the graph regularity, average degree, and diameter. Further, real game graphs demonstrate that information generated in high population hubs can be propagated faster than that generated in smaller quests from outlying areas.
基于玩家行为的非玩家角色互动的声誉系统
数字游戏强调任务完成的理念;通过完成任务,角色将从任务提供者那里获得资源,他们也将因完成任务而获得非玩家角色(npc)的声誉。然而,这种名声目前以一种不现实的方式在游戏世界中传播;许多npc将知道一个任务的完成,许多乡镇没有叙述的理由。在本文中,我们研究了一种允许NPC互动在游戏世界中传播声誉的方法,从任务完成的初始见证点到所有其他NPC。这个模型是通过一系列的连接图来检验的:大小为5的模型,小世界图,以及来自数字游戏的图。测试表明,信息的传播高度依赖于易于建立的相互作用属性,例如图的规则性、平均度和直径。此外,真实的游戏图表表明,在人口密集的中心产生的信息传播速度要快于在偏远地区的小任务中产生的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信