首页> 外文会议>IFAC Symposium on Computation in Economics, Finance and Engineering >Simulating computable overlapping generations models with troll
【24h】

Simulating computable overlapping generations models with troll

机译:使用巨魔模拟可计算的重叠几代模型

获取原文

摘要

In this note, we examine the performance of Troll new Stacked-time algorithm in the simulation of large scale overlapping generations (OLG) models. At each period of time, the number of equations is proportional to individuals' lifetime. The model size and the data requirements may thus be very large. Given the repetitive structure of the model equations, it is possible to explode a generic version of them and the initial dataset, using a macrofile in which the time horizon and the lifetime are completely parameterized. We provide a generic instance of such a model and useful macrofiles for a basic consumption model. The Stacked-time algorithm performances are checked for this basic model as well as for a very large scale model with endogenous labour supply and uncertain lifetime. It turns out that Troll performances are very attractive even for a system with more than 300000 simultaneous equations (600 equations × 500 periods).
机译:在本说明书中,我们研究了大规模重叠几代(OLG)模型的模拟中的Troll新堆叠时间算法的性能。在每一段时间内,等式数与个体的寿命成比例。因此,模型大小和数据要求可能非常大。考虑到模型方程的重复结构,可以使用Macrofile爆炸它们的通用版本和初始数据集,其中时间地平线和寿命完全参数化。我们为基本消费模型提供了这种模型和有用的Macrofiles的泛型实例。检查该基本模型的堆叠时间算法性能以及具有内源性劳动力供应和不确定的寿命的非常大的规模模型。事实证明,即使对于具有超过300000个同时方程式的系统(600方程×500周期),巨大性能甚至非常有吸引力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号