Skip to main content

2017 | OriginalPaper | Buchkapitel

7. Dynamic Programming

verfasst von : Kiyohiko G. Nishimura, Hiroyuki Ozaki

Erschienen in: Economics of Pessimism and Optimism

Verlag: Springer Japan

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Ozaki H, Streufert PA (1996). Dynamic programming for non-additive stochastic objectives. J Math Econ 25:391–442 (Ozaki and Streufert (1996)) and Ozaki H (2002). Dynamic programming with upper semi-continuous stochastic aggregator. Adv. Math. Econ 4:25–39 (Ozaki (2002)) developed a theory of stochastic dynamic programming by generalizing the expectation operator E to a more abstract operator M, which maps a measurable function to another measurable function.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
See Sect. 2.​5 for the definition of \(\mathcal {B}_S\).
 
2
Because S is assumed to be Polish, there is no notational ambiguity between \(\left( \mathcal {B}_{S} \right) ^t\) and \(\mathcal {B}_{\left( S^t \right) }\) in defining it.
 
3
We say “overly optimistic” because \(_0\bar{\varvec{F}}(y)\) is not actually attainable under the feasibility requirement.
 
4
We say “overly optimistic” because \(U_s(_0\bar{\varvec{F}}(y))\) is not actually attained as a utility number under the feasibility requirement.
 
5
In addition to the existence of \(\arg \max \), the measurability of the integrand is still unknown.
 
6
This means that our dynamic programming technique will be applicable even if the common severe assumption of compact-supportness of the distribution were violated.
 
Literatur
Zurück zum Zitat Blackwell, D. 1965. Discounted dynamic programming. Annals of Mathematical Statistics, 36, 226–235. Blackwell, D. 1965. Discounted dynamic programming. Annals of Mathematical Statistics, 36, 226–235.
Zurück zum Zitat Koopmans, T.C. 1960. Stationary ordinal utility and impatience. Econometrica 28: 287–309.CrossRef Koopmans, T.C. 1960. Stationary ordinal utility and impatience. Econometrica 28: 287–309.CrossRef
Zurück zum Zitat Nishimura, K. G., and Ozaki, H. 2004. Search and Knightian uncertainty, Journal of. Economic Theory, 119, 299–333. Nishimura, K. G., and Ozaki, H. 2004. Search and Knightian uncertainty, Journal of. Economic Theory, 119, 299–333.
Zurück zum Zitat Ozaki, H. 2002. Dynamic programming with upper semi-continuous stochastic aggregator. Advances in Mathematical Economics 4: 25–39. Ozaki, H. 2002. Dynamic programming with upper semi-continuous stochastic aggregator. Advances in Mathematical Economics 4: 25–39.
Zurück zum Zitat Ozaki, H., and Streufert, P.A. 1996. Dynamic programming for non-additive stochastic objectives. Journal of Mathematical Economics 25: 391–442. Ozaki, H., and Streufert, P.A. 1996. Dynamic programming for non-additive stochastic objectives. Journal of Mathematical Economics 25: 391–442.
Zurück zum Zitat Strauch, R. E. 1966. Negative dynamic programming. Annals of mathematical statistics, 37, 871–890. Strauch, R. E. 1966. Negative dynamic programming. Annals of mathematical statistics, 37, 871–890.
Zurück zum Zitat Streufert, P.A. 1990. Stationary recursive utility and dynamic programming under the assumption of biconvergence. Review of Economic Studies 57: 79–97.CrossRef Streufert, P.A. 1990. Stationary recursive utility and dynamic programming under the assumption of biconvergence. Review of Economic Studies 57: 79–97.CrossRef
Metadaten
Titel
Dynamic Programming
verfasst von
Kiyohiko G. Nishimura
Hiroyuki Ozaki
Copyright-Jahr
2017
Verlag
Springer Japan
DOI
https://doi.org/10.1007/978-4-431-55903-0_7

Premium Partner