Simulating job-search models using simulating annealing
Paper deals with a simulation of job-search models using simulated annealing (SA). It is standard to test Burdett-Mortensen on-the-job search model which gives a unique solution. Unfortunately, its later generalizations especially incorporation of heterogeneous agents has overcome this unique equilibrium point for the generalized model could produce multiple equilibriums as well. In such cases many statistical methods using conventional numerical optimization algorithms could fail to find a global optimum point. Simulated annealing, instead, is very robust method capable of finding global optimum point also on very difficult non-linear functions. The method could be applied in discrete or continuous global optimization problems. Its recent modifications, i.e. Adaptive Simulated Annealing, have shortened the convergence time to converge in real time which has made the method widely applicable. Paper doesnâ€™t give additional improvements of the simulated annealing method but applies it to the job-search models
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||04 Jul 2006|
|Date of revision:|
|Contact details of provider:|| Web page: http://comp-econ.org/|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecfa:296. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.