Newest papers

Theoretical Foundations of Sequential Dynamic Programming

Alan Lujan · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.27449 · cited by 0 works (OpenAlex) · open-access PDF

Portuguese

Muitos problemas econômicos têm vários controles por período, cuja escolha conjunta está sujeita à maldição da dimensionalidade. Resolvê-los em estágios é computacionalmente mais barato, mas nenhum resultado geral diz quando a estagnação é exata. Eu desenvolvo uma teoria de separação, escolhas discretas e objetivos não-concave incluídos: a estagnação é exata se a utilidade, transições e restrições dependem de decisões anteriores apenas através de um estado passado para a frente. Para cada ordem o menor tal estado existe e é único até a re-etiquetação. Qualquer estado que continua a estagnação exata para todas as preferências sobre decisões posteriores e o futuro deve carregar tudo o que o menor carrega para a transição. Para os primitivos afinados, o menor estado consiste nas

Machine translation (Meta M2M100); the English original follows.

Abstract

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 included: staging is exact if utility, transitions, and constraints depend on earlier decisions only through a state passed forward. For each ordering the smallest such state exists and is unique up to relabeling. Any state that keeps staging exact for all preferences over later decisions and the future must carry everything the smallest one carries for the transition. For affine primitives, the smallest state consists of the linear combinations, such as cash-on-hand, on which later outcomes depend. Its dimensions pick the order whose largest stage is smallest. In a six-choice household model, each stage chooses one variable on a three-dimensional state, the joint problem all six.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: State (computer science), Affine transformation, Carry (investment), Dynamic programming, Mathematical economics, Mathematics

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.27449, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange