This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

EURACE: A Massively Parallel Agent-Based Model of the European Economy

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Christophe Deissenberg () (GREQAM - Groupement de Recherche en Économie Quantitative d'Aix-Marseille - Université de la Méditerranée - Aix-Marseille II - Université Paul Cézanne - Aix-Marseille III - Ecole des Hautes Etudes en Sciences Sociales - CNRS : UMR6579)
Sander Van Der Hoog () (GREQAM - Groupement de Recherche en Économie Quantitative d'Aix-Marseille - Université de la Méditerranée - Aix-Marseille II - Université Paul Cézanne - Aix-Marseille III - Ecole des Hautes Etudes en Sciences Sociales - CNRS : UMR6579)
Herbert Dawid () (Dept. of Business Administration - Bielefeld University)

Additional information is available for the following registered author(s):

Abstract

EURACE is a major European attempt to construct an agent-based model of the European economy with a very large population of autonomous, purposive agents interacting in a complicated economic environment. To create it, major advances are needed, in particular in terms of economic modeling and software engineering.In this paper, we describe the general structure of the economic model developed for EURACE and present the Flexible Large-scale Agent Modeling Environment (FLAME) that will be used to describe the agents and run the model on massively parallel supercomputers. Illustrative simulations with a simplifiedmodel based on EURACE's labour market module are presented.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://halshs.archives-ouvertes.fr/docs/00/33/97/56/PDF/DT2008-39.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by HAL in its series Working Papers with number halshs-00339756_v1.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 18 Nov 2008
Date of revision:
Handle: RePEc:hal:wpaper:halshs-00339756_v1

Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00339756/en/
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/

For technical questions regarding this item, or to correct its listing, contact: (CCSD).

Related research
Keywords: Agent-based Computational Economics; X-Machines; Parallelcomputation.;

This paper has been announced in the following NEP Reports:

Cited by:
(explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)
  1. Giovanni Dosi & Giorgio Fagiolo & Andrea Roventini, 2008. "Schumpeter Meeting Keynes: A Policy-Friendly Model of Endogenous Growth and Business Cycles," LEM Papers Series 2008/21, Laboratory of Economics and Management (LEM), Sant'Anna School of Advanced Studies, Pisa, Italy. [Downloadable!]
    Other versions:
Statistics
Access and download statistics

Did you know? Authors registered on the RePEc Author Service receive monthly emails with details about downloads and abstract views of their works.

This page was last updated on 2009-11-28.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.