<An> abstract topological approach to dynamic programming.
Poukaz na to, že keď je daná bikonvergencia, existuje funkcia, ktorá je charakterizovaná ako jediné prípustné riešenie Bellmanovej rovnice a ktorá môže byť vypočítaná ako limit postupnosti aproximácií. Odvodenie veľmi silnej postačujúcej podmienky bikonvergencie.
Saved in:
| Main Author: | |
|---|---|
| Format: | Book Chapter |
| Language: | English |
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: <An> abstract topological approach to dynamic programming.
- Duality between direct and indirect utility functions under minimal hypotheses.
- Non-standard concave utility functions.
- Optimal strategies generated for the mathematical model of source distribution using a dynamic programming method algorithm
- Continuous representation of von Neumann-Morgenstern preferences.
- Dominance conditions in non-additive expected utility theory.
- Dynamic Programming and Optimal Control