![]() | This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
The so-called paradox of backward induction is really about backward deduction. -- Arno Matthias 14:33, 1 August 2006 (UTC)
The meaning of "backward induction" in game theory is closely related to its meaning in dynamic programming. I see no reason this page couldn't include sections on both topics. Moving that discussion to the Bellman equation page, section "solution methods" would likely make the Bellman equation page far too long (at least once the Bellman equation page progresses past stub class). I'll be happy to provide a short section here on backwards induction in dynamic programming. Rinconsoleao 17:17, 13 November 2007 (UTC)
The prisoner assumes her jailers are telling the truth in a completely precise way.
The actual meaning of their words are, "you will have no information about which day you will be executed on, until you find that you are alive at the end of a day."
The only way for the wording to be precisely correct is if there is a chance she will not be executed at all, or that the execution will be delayed. —Preceding unsigned comment added by 96.26.192.159 ( talk) 22:00, 11 May 2008 (UTC)
oops, autosigned by SineBot :p forgot.
In the "prologue" of the page it is written:
In game theory, backward induction was first employed by John von Neumann and Oskar Morgenstern in their Theory of Games and Economic Behavior (1944). [1]
The reference quoted mentions vN and M, here:
Others claim he used a method of proof, known as 'backwards induction' that was not employed until 1953, by von Neumann and Morgenstern.
I am quite suspicious about this reference: 1953 is just the date of the 3rd edition of the book by vN and M, while it is the year in which it appeared the proof of the Kuhn's theorem which guarantees that finite games with perfect information have a Nash equilibrium in pure strategies. And the proof is based on backward induction.
I would like to see some more reliable attribution of backward induction to vN and M (quoting page or chapter of some edition of the book). -- Fioravante Patrone en ( talk) 06:38, 8 March 2009 (UTC)
I guess the "time 9" in below line should be "time 8"
Since we have already concluded that offers at time 9 should be accepted, the expected value of waiting for a job offer at time 9 is 0.5*($200+$88) = $144.
An editor has identified a potential problem with the redirect
Induzione a ritroso and has thus listed it
for discussion. This discussion will occur at
Wikipedia:Redirects for discussion/Log/2022 February 13#Induzione a ritroso until a consensus is reached, and readers of this page are welcome to contribute to the discussion. ~~~~
User:1234qwer1234qwer4 (
talk)
02:39, 13 February 2022 (UTC)
I think this article could benefit by exclusively focusing on backward induction in the context of game theory. Earlsofsandwich ( talk) 05:07, 27 June 2024 (UTC)
![]() | This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
The so-called paradox of backward induction is really about backward deduction. -- Arno Matthias 14:33, 1 August 2006 (UTC)
The meaning of "backward induction" in game theory is closely related to its meaning in dynamic programming. I see no reason this page couldn't include sections on both topics. Moving that discussion to the Bellman equation page, section "solution methods" would likely make the Bellman equation page far too long (at least once the Bellman equation page progresses past stub class). I'll be happy to provide a short section here on backwards induction in dynamic programming. Rinconsoleao 17:17, 13 November 2007 (UTC)
The prisoner assumes her jailers are telling the truth in a completely precise way.
The actual meaning of their words are, "you will have no information about which day you will be executed on, until you find that you are alive at the end of a day."
The only way for the wording to be precisely correct is if there is a chance she will not be executed at all, or that the execution will be delayed. —Preceding unsigned comment added by 96.26.192.159 ( talk) 22:00, 11 May 2008 (UTC)
oops, autosigned by SineBot :p forgot.
In the "prologue" of the page it is written:
In game theory, backward induction was first employed by John von Neumann and Oskar Morgenstern in their Theory of Games and Economic Behavior (1944). [1]
The reference quoted mentions vN and M, here:
Others claim he used a method of proof, known as 'backwards induction' that was not employed until 1953, by von Neumann and Morgenstern.
I am quite suspicious about this reference: 1953 is just the date of the 3rd edition of the book by vN and M, while it is the year in which it appeared the proof of the Kuhn's theorem which guarantees that finite games with perfect information have a Nash equilibrium in pure strategies. And the proof is based on backward induction.
I would like to see some more reliable attribution of backward induction to vN and M (quoting page or chapter of some edition of the book). -- Fioravante Patrone en ( talk) 06:38, 8 March 2009 (UTC)
I guess the "time 9" in below line should be "time 8"
Since we have already concluded that offers at time 9 should be accepted, the expected value of waiting for a job offer at time 9 is 0.5*($200+$88) = $144.
An editor has identified a potential problem with the redirect
Induzione a ritroso and has thus listed it
for discussion. This discussion will occur at
Wikipedia:Redirects for discussion/Log/2022 February 13#Induzione a ritroso until a consensus is reached, and readers of this page are welcome to contribute to the discussion. ~~~~
User:1234qwer1234qwer4 (
talk)
02:39, 13 February 2022 (UTC)
I think this article could benefit by exclusively focusing on backward induction in the context of game theory. Earlsofsandwich ( talk) 05:07, 27 June 2024 (UTC)