Reference health
Approximate Dynamic Programming with Postdecision States as a Solution Method For Dynamic Economic
22/22 checkable references clean · checked 2026-08-28
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
11 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 22 checked references that resolve
resolves10.1016/s0165-1889(99)00016-0
Algorithms for solving dynamic models with occasionally binding constraints
resolves10.1086/ahr/46.2.418
<i>Cockpit of the Revolution: The War for Independence in New Jersey</i>. By Leonard Lundin. [The Princeton History of New Jersey.] (Princeton: Princeton University Press. 1940. Pp. xiv, 463. $3.75.)
resolves10.1016/j.jedc.2008.12.010
Comparison of solutions to the incomplete markets model with aggregate uncertainty
resolves10.1016/j.jedc.2008.12.009
Assessing the accuracy of the aggregate law of motion in models with heterogeneous agents
resolves10.1080/07350015.1990.10509770
Solving the Stochastic Growth Model by Parameterizing Expectations
resolves10.1016/j.jedc.2008.12.008
Solving the incomplete markets model with aggregate uncertainty using explicit aggregation
resolves10.1016/S0165-1889(99)00077-9
Approximating and simulating the stochastic growth model: Parameterized expectations, neural networks, and the genetic algorithm
resolves10.1017/S1365100508070363
COMPUTATION OF BUSINESS CYCLE MODELS: A COMPARISON OF NUMERICAL METHODS
resolves10.3982/qe14
Numerically stable and accurate stochastic simulation approaches for solving dynamic economic models
resolves10.1093/0199248273.003.0006
Application of Weighted Residual Methods to Dynamic Economic Models
resolves10.1007/s10614-005-2224-9
Parameterized Expectations Algorithm: How to Solve for Labor Easily
resolves10.1016/j.jedc.2009.03.009
Solving the incomplete markets model with aggregate uncertainty using the Krusell–Smith algorithm
resolves10.1287/trsc.1080.0238
An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application
resolves10.1109/CDC.1997.652501
A neuro-dynamic programming approach to retailer inventory management
The 11 references without a DOI — listed, not checked
no DOI — not checkedChapter 6: Approximate Dynamic Programming
no DOI — not checkedref4
no DOI — not checkedTowards Faster Stochastic Gradient Search
no DOI — not checkedref16
no DOI — not checkedref20
no DOI — not checkedApproximate Dynamic Programming Policies and Performance Bounds for Ambulance Redeployment
no DOI — not checkedref26
no DOI — not checkedPerspectives of Approximate Dynamic Programming
no DOI — not checkedApproximate Dynamic Programming With Correlated Bayesian Beliefs
no DOI — not checkedref30
no DOI — not checkedref32
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-08-28 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.2139/ssrn.2350679"><img src="https://citestamp.com/citestamped/10.2139/ssrn.2350679/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.2139/ssrn.2350679)