arXiv (All)
open access
Theoretical Foundations of Sequential Dynamic Programming
Many economic problems have several controls per period, whose joint choice is subject to the curse of dimensionality. Solving them in stages is computationally cheaper, but no general result says when staging is exact. I develop a separability theory, discrete choices and non-concave objectives inc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Nonlinear functional analysis and optimal economic growth#1277775
- If the utility function is unbounded, any finite utility assignment to the St Petersburg game is consistent with expected utility theory#689787
- Mathematics for economic analysis#376482
- Designing Markets for Screening: Optimal Composition and the Geometry of Surplus#1324505
- Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs#665588
Record · ID 1402837
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive