Accelerating Hybrid Agent-Based Models and Fuzzy Cognitive Maps: How to Combine Agents who Think Alike?

Philippe J. Giabbanelli, Jack T. Beerman
{"title":"Accelerating Hybrid Agent-Based Models and Fuzzy Cognitive Maps: How to Combine Agents who Think Alike?","authors":"Philippe J. Giabbanelli, Jack T. Beerman","doi":"arxiv-2409.00824","DOIUrl":null,"url":null,"abstract":"While Agent-Based Models can create detailed artificial societies based on\nindividual differences and local context, they can be computationally\nintensive. Modelers may offset these costs through a parsimonious use of the\nmodel, for example by using smaller population sizes (which limits analyses in\nsub-populations), running fewer what-if scenarios, or accepting more\nuncertainty by performing fewer simulations. Alternatively, researchers may\naccelerate simulations via hardware solutions (e.g., GPU parallelism) or\napproximation approaches that operate a tradeoff between accuracy and compute\ntime. In this paper, we present an approximation that combines agents who\n`think alike', thus reducing the population size and the compute time. Our\ninnovation relies on representing agent behaviors as networks of rules (Fuzzy\nCognitive Maps) and empirically evaluating different measures of distance\nbetween these networks. Then, we form groups of think-alike agents via\ncommunity detection and simplify them to a representative agent. Case studies\nshow that our simplifications remain accuracy.","PeriodicalId":501315,"journal":{"name":"arXiv - CS - Multiagent Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Multiagent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.00824","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

While Agent-Based Models can create detailed artificial societies based on individual differences and local context, they can be computationally intensive. Modelers may offset these costs through a parsimonious use of the model, for example by using smaller population sizes (which limits analyses in sub-populations), running fewer what-if scenarios, or accepting more uncertainty by performing fewer simulations. Alternatively, researchers may accelerate simulations via hardware solutions (e.g., GPU parallelism) or approximation approaches that operate a tradeoff between accuracy and compute time. In this paper, we present an approximation that combines agents who `think alike', thus reducing the population size and the compute time. Our innovation relies on representing agent behaviors as networks of rules (Fuzzy Cognitive Maps) and empirically evaluating different measures of distance between these networks. Then, we form groups of think-alike agents via community detection and simplify them to a representative agent. Case studies show that our simplifications remain accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
加速基于代理的混合模型和模糊认知地图:如何将思维相似的代理结合起来?
虽然基于代理的模型可以根据个体差异和当地环境创建详细的人工社会,但它们可能是计算密集型的。建模者可以通过对模型的简化使用来抵消这些成本,例如使用较小的种群规模(这限制了对子种群的分析),运行较少的假设情景,或通过执行较少的模拟来接受更多的不确定性。另外,研究人员也可以通过硬件解决方案(如 GPU 并行性)或近似方法来加速模拟,在精度和计算时间之间进行权衡。在本文中,我们提出了一种近似方法,将 "思维相似 "的代理结合在一起,从而减少了群体规模和计算时间。我们的创新依赖于将代理行为表示为规则网络(模糊认知图),并通过经验评估这些网络之间的不同距离度量。然后,我们通过社群检测组建思维相似的代理群体,并将其简化为一个代表性代理。案例研究表明,我们的简化仍然是准确的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Putting Data at the Centre of Offline Multi-Agent Reinforcement Learning HARP: Human-Assisted Regrouping with Permutation Invariant Critic for Multi-Agent Reinforcement Learning On-policy Actor-Critic Reinforcement Learning for Multi-UAV Exploration CORE-Bench: Fostering the Credibility of Published Research Through a Computational Reproducibility Agent Benchmark Multi-agent Path Finding in Continuous Environment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1