A divide and conquer algorithm for exploiting policy function monotonicity

Grey Gordon and Shi Qiu ()

Quantitative Economics, 2018, vol. 9, issue 2, 521-540

Abstract: A divide and conquer algorithm for exploiting policy function monotonicity is proposed and analyzed. To solve a discrete problem with n states and n choices, the algorithm requires at most nlog2(n)+5n objective function evaluations. In contrast, existing methods for nonconcave problems require n2 evaluations in the worst case. For concave problems, the solution technique can be combined with a method exploiting concavity to reduce evaluations to 14n+2log2(n). A version of the algorithm exploiting monotonicity in two‐state variables allows for even more efficient solutions. The algorithm can also be efficiently employed in a common class of problems that do not have monotone policies, including problems with many state and choice variables. In the sovereign default model of Arellano (2008) and in the real business cycle model, the algorithm reduces run times by an order of magnitude for moderate grid sizes and orders of magnitude for larger ones. Sufficient conditions for monotonicity and code are provided.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
https://doi.org/10.3982/QE640

Related works:
Working Paper: A Divide and Conquer Algorithm for Exploiting Policy Function Monotonicity (2017)
Working Paper: A Divide and Conquer Algorithm for Exploiting Policy Function Monotonicity (2015)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:quante:v:9:y:2018:i:2:p:521-540

Ordering information: This journal article can be ordered from
https://www.econometricsociety.org/membership

Access Statistics for this article

More articles in Quantitative Economics from Econometric Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().