验证和功能复杂性

R. Marks
{"title":"验证和功能复杂性","authors":"R. Marks","doi":"10.2139/ssrn.2342868","DOIUrl":null,"url":null,"abstract":"This paper provides a framework for discussing the validity of computer simulation models of market phenomena. It defines functional complexity and derives measures of this for a well known agent-based simulation model and suggests methods to overcome the obstacle of complexity in validating such models.","PeriodicalId":180753,"journal":{"name":"UNSW: Economics (Topic)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Validation and Functional Complexity\",\"authors\":\"R. Marks\",\"doi\":\"10.2139/ssrn.2342868\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper provides a framework for discussing the validity of computer simulation models of market phenomena. It defines functional complexity and derives measures of this for a well known agent-based simulation model and suggests methods to overcome the obstacle of complexity in validating such models.\",\"PeriodicalId\":180753,\"journal\":{\"name\":\"UNSW: Economics (Topic)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"UNSW: Economics (Topic)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.2342868\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"UNSW: Economics (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.2342868","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文为讨论市场现象的计算机模拟模型的有效性提供了一个框架。它定义了功能复杂性,并为一个众所周知的基于智能体的仿真模型导出了功能复杂性的度量,并提出了在验证此类模型时克服复杂性障碍的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Validation and Functional Complexity
This paper provides a framework for discussing the validity of computer simulation models of market phenomena. It defines functional complexity and derives measures of this for a well known agent-based simulation model and suggests methods to overcome the obstacle of complexity in validating such models.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信