Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Backward_induction> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Backward_induction abstract "Backward induction is the process of reasoning backwards in time, from the end of a problem or situation, to determine a sequence of optimal actions. It proceeds by first considering the last time a decision might be made and choosing what to do in any situation at that time. Using this information, one can then determine what to do at the second-to-last time of decision. This process continues backwards until one has determined the best action for every possible situation (i.e. for every possible information set) at every point in time.In the mathematical optimization method of dynamic programming, backward induction is one of the main methods for solving the Bellman equation. In game theory, backward induction is a method used to compute subgame perfect equilibria in sequential games. The only difference is that optimization involves just one decision maker, who chooses what to do at each point of time, whereas game theory analyzes how the decisions of several players interact. That is, by anticipating what the last player will do in each situation, it is possible to determine what the second-to-last player will do, and so on. In the related fields of automated planning and scheduling and automated theorem proving, the method is called backward search or backward chaining. In chess it is called retrograde analysis.Backward induction has been used to solve games as long as the field of game theory has existed. John von Neumann and Oskar Morgenstern suggested solving zero-sum, two-person games by backward induction in their Theory of Games and Economic Behavior (1944), the book which established game theory as a field of study.".
- Backward_induction wikiPageID "2060912".
- Backward_induction wikiPageRevisionID "606620884".
- Backward_induction hasPhotoCollection Backward_induction.
- Backward_induction subject Category:Dynamic_programming.
- Backward_induction subject Category:Game_theory.
- Backward_induction subject Category:Inductive_reasoning.
- Backward_induction subject Category:Mathematical_optimization.
- Backward_induction comment "Backward induction is the process of reasoning backwards in time, from the end of a problem or situation, to determine a sequence of optimal actions. It proceeds by first considering the last time a decision might be made and choosing what to do in any situation at that time. Using this information, one can then determine what to do at the second-to-last time of decision. This process continues backwards until one has determined the best action for every possible situation (i.e.".
- Backward_induction label "Backward induction".
- Backward_induction label "Inducción hacia atrás".
- Backward_induction label "Indukcja wsteczna".
- Backward_induction label "Induzione a ritroso".
- Backward_induction label "Raisonnement rétrograde".
- Backward_induction label "Rückwärtsinduktion".
- Backward_induction sameAs Rückwärtsinduktion.
- Backward_induction sameAs Inducción_hacia_atrás.
- Backward_induction sameAs Raisonnement_rétrograde.
- Backward_induction sameAs Induzione_a_ritroso.
- Backward_induction sameAs Indukcja_wsteczna.
- Backward_induction sameAs m.06jbhy.
- Backward_induction sameAs Q968642.
- Backward_induction sameAs Q968642.
- Backward_induction wasDerivedFrom Backward_induction?oldid=606620884.
- Backward_induction isPrimaryTopicOf Backward_induction.