基于agent的复杂系统预测模型

J. Gareth Polhill, M. Hare, Tom Bauermann, D. Anzola, E. Palmer, D. Salt, Patrycja Antosz
{"title":"基于agent的复杂系统预测模型","authors":"J. Gareth Polhill, M. Hare, Tom Bauermann, D. Anzola, E. Palmer, D. Salt, Patrycja Antosz","doi":"10.18564/jasss.4597","DOIUrl":null,"url":null,"abstract":": This paper uses two thought experiments to argue that the complexity of the systems to which agent-based models (ABMs) are often applied is not the central source of difficulties ABMs have with prediction. We define various levels of predictability, and argue that insofar as path-dependency is a necessary attribute of a complex system, ruling out states of the system means that there is at least the potential to say something useful. ‘Wickedness’ is argued to be a more significant challenge to prediction than complexity. Critically, however, neither complexity nor wickedness makes prediction theoretically impossible in the sense of being formally undecidable computationally-speaking: intractable being the more apt term given the exponential sizes of the spaces being searched. However, endogenous ontological novelty in wicked systems is shown to render prediction futile beyond the immediately short term.","PeriodicalId":14675,"journal":{"name":"J. Artif. Soc. Soc. Simul.","volume":"140 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Using Agent-Based Models for Prediction in Complex and Wicked Systems\",\"authors\":\"J. Gareth Polhill, M. Hare, Tom Bauermann, D. Anzola, E. Palmer, D. Salt, Patrycja Antosz\",\"doi\":\"10.18564/jasss.4597\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": This paper uses two thought experiments to argue that the complexity of the systems to which agent-based models (ABMs) are often applied is not the central source of difficulties ABMs have with prediction. We define various levels of predictability, and argue that insofar as path-dependency is a necessary attribute of a complex system, ruling out states of the system means that there is at least the potential to say something useful. ‘Wickedness’ is argued to be a more significant challenge to prediction than complexity. Critically, however, neither complexity nor wickedness makes prediction theoretically impossible in the sense of being formally undecidable computationally-speaking: intractable being the more apt term given the exponential sizes of the spaces being searched. However, endogenous ontological novelty in wicked systems is shown to render prediction futile beyond the immediately short term.\",\"PeriodicalId\":14675,\"journal\":{\"name\":\"J. Artif. Soc. Soc. Simul.\",\"volume\":\"140 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Artif. Soc. Soc. Simul.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18564/jasss.4597\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Artif. Soc. Soc. Simul.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18564/jasss.4597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

本文使用两个思想实验来论证基于主体的模型(ABMs)经常应用的系统的复杂性并不是ABMs预测困难的主要来源。我们定义了各种级别的可预测性,并认为只要路径依赖是复杂系统的必要属性,排除系统的状态意味着至少有可能说一些有用的东西。“邪恶”被认为是对预测的一个比复杂性更大的挑战。然而,关键的是,无论是复杂性还是邪恶都不会使预测在理论上不可能,因为从计算角度来说,它在形式上是不可确定的:考虑到正在搜索的空间的指数大小,难以处理是更合适的术语。然而,在邪恶的系统中,内生的本体论新颖性被证明会使预测在短期内无效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Using Agent-Based Models for Prediction in Complex and Wicked Systems
: This paper uses two thought experiments to argue that the complexity of the systems to which agent-based models (ABMs) are often applied is not the central source of difficulties ABMs have with prediction. We define various levels of predictability, and argue that insofar as path-dependency is a necessary attribute of a complex system, ruling out states of the system means that there is at least the potential to say something useful. ‘Wickedness’ is argued to be a more significant challenge to prediction than complexity. Critically, however, neither complexity nor wickedness makes prediction theoretically impossible in the sense of being formally undecidable computationally-speaking: intractable being the more apt term given the exponential sizes of the spaces being searched. However, endogenous ontological novelty in wicked systems is shown to render prediction futile beyond the immediately short term.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Conflicting Information and Compliance with COVID-19 Behavioral Recommendations Particle Swarm Optimization for Calibration in Spatially Explicit Agent-Based Modeling The Role of Reinforcement Learning in the Emergence of Conventions: Simulation Experiments with the Repeated Volunteer's Dilemma Generation of Synthetic Populations in Social Simulations: A Review of Methods and Practices An Integrated Ecological-Social Simulation Model of Farmer Decisions and Cropping System Performance in the Rolling Pampas (Argentina)
×
引用
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