|
|
|
A Rapid Grid Search Method for Solving Dynamic Programming Problems in Economics |
Hui He1( ), Hao Zhang2() |
| 1. School of Economics, and Key Laboratory of Mathematical Economics, Shanghai University of Finance and Economics, Shanghai 200433, China; 2. School of Labor and Human Resources, Renmin University of China, Beijing 100872, China |
|
|
|
|
Abstract We introduce a rapid grid search method in solving dynamic programming problems in economics. Compared to mainstream grid search methods, by using local information of the Bellman equation, this method can significantly increase the efficiency in solving dynamic programming problems by reducing the grid points searched in the control space.
|
| Keywords
dynamic programming
Bellman equation
grid search
concavity
searching efficiency
|
|
Corresponding Author(s):
Hui He,Email:he.hui@mail.shufe.edu.cn; Hao Zhang,Email:hao.zhang@ruc.edu.cn
|
|
Issue Date: 05 June 2013
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
