About: Stochastic dynamic programming

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Originally introduced by Richard E. Bellman in, stochastic dynamic programming is a technique for modelling and solving problems of decision making under uncertainty. Closely related to stochastic programming and dynamic programming, stochastic dynamic programming represents the problem under scrutiny in the form of a Bellman equation. The aim is to compute a policy prescribing how to act optimally in the face of uncertainty.

Property	Value
dbo:abstract	Originally introduced by Richard E. Bellman in, stochastic dynamic programming is a technique for modelling and solving problems of decision making under uncertainty. Closely related to stochastic programming and dynamic programming, stochastic dynamic programming represents the problem under scrutiny in the form of a Bellman equation. The aim is to compute a policy prescribing how to act optimally in the face of uncertainty. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/Gambling_game_optimal_policy.png?width=300
dbo:wikiPageExternalLink	https://github.com/gwr3n/jsdp/blob/master/jsdp/src/main/java/jsdp/app/standalone/stochastic/GamblersRuin.java
dbo:wikiPageID	52759748 (xsd:integer)
dbo:wikiPageLength	23776 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	1120518221 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Bellman_equation dbr:Python_(programming_language) dbr:Memoization dbc:Optimal_control dbc:Dynamic_programming dbr:Richard_E._Bellman dbr:Curse_of_dimensionality dbr:Decision_theory dbr:Optimal_decision dbr:Stationary_process dbr:Functional_equation dbr:Markov_property dbc:Optimization_algorithms_and_methods dbr:File:Gambling_game_optimal_policy.png dbr:Dynamic_programming dbr:Pairwise_independence dbr:Discounting dbr:Random_variable dbr:Reinforcement_learning dbr:Java_8 dbc:Stochastic_optimization dbr:St._Petersburg_paradox dbr:Markov_decision_process dbr:Stochastic_process dbr:Stochastic_programming dbr:Stochastic_dynamic_programming dbr:(0,_0.6),(2,_0.4)]_for_i_in_range(0,4)]}
dbp:colwidth	30 (xsd:integer)
dbp:small	yes (en)
dbp:wikiPageUsesTemplate	dbt:Annotated_link dbt:Citation dbt:Div_col dbt:Div_col_end dbt:Expand_section dbt:Harv dbt:Portal dbt:Reflist dbt:Short_description
dcterms:subject	dbc:Optimal_control dbc:Dynamic_programming dbc:Optimization_algorithms_and_methods dbc:Stochastic_optimization
rdfs:comment	Originally introduced by Richard E. Bellman in, stochastic dynamic programming is a technique for modelling and solving problems of decision making under uncertainty. Closely related to stochastic programming and dynamic programming, stochastic dynamic programming represents the problem under scrutiny in the form of a Bellman equation. The aim is to compute a policy prescribing how to act optimally in the face of uncertainty. (en)
rdfs:label	Stochastic dynamic programming (en)
owl:sameAs	wikidata:Stochastic dynamic programming https://global.dbpedia.org/id/2chs6
prov:wasDerivedFrom	wikipedia-en:Stochastic_dynamic_programming?oldid=1120518221&ns=0
foaf:depiction	wiki-commons:Special:FilePath/Gambling_game_optimal_policy.png
foaf:isPrimaryTopicOf	wikipedia-en:Stochastic_dynamic_programming
is dbo:knownFor of	dbr:Richard_E._Bellman
is dbo:wikiPageRedirects of	dbr:Solution_methods_for_stochastic_dynamic_programs dbr:Stochastic_Dynamic_Programming
is dbo:wikiPageWikiLink of	dbr:Richard_E._Bellman dbr:Solution_methods_for_stochastic_dynamic_programs dbr:Stochastic_programming dbr:Stochastic_Dynamic_Programming dbr:Stochastic_dynamic_programming
is dbp:knownFor of	dbr:Richard_E._Bellman
is foaf:primaryTopic of	wikipedia-en:Stochastic_dynamic_programming