Skip to content

Commit 341df07

Browse files
jstacclaude
andcommitted
Fix broken reference in aiyagari.md: Replace opt_savings_2 with Dynamic Programming book link
Replace the broken cross-reference to opt_savings_2 (which doesn't exist in this PR) with a direct link to the Dynamic Programming book at dp.quantecon.org where Howard policy iteration is discussed in detail. This fixes the build warning: aiyagari.md:689: WARNING: unknown document: 'opt_savings_2' 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude <[email protected]>
1 parent 864b2fe commit 341df07

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

lectures/aiyagari.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -686,7 +686,7 @@ plt.show()
686686

687687
In this lecture, we used value function iteration to solve the household problem.
688688

689-
An alternative is Howard policy iteration (HPI), which is discussed in detail in {doc}`opt_savings_2`.
689+
An alternative is Howard policy iteration (HPI), which is discussed in detail in [Dynamic Programming](https://dp.quantecon.org/).
690690

691691
HPI can be faster than VFI for some problems because it uses fewer but more computationally intensive iterations.
692692

0 commit comments

Comments
 (0)