康尼島（英語：），又译科尼島，是位於美國紐約市布魯克林區的半島，原本為一座海島，其面向大西洋的海灘是美國知名的休閒娛樂區域。居民大多集中位於半島的西側，約有六萬人左右，範圍西至希捷社區，東至布萊登海灘和曼哈頓海灘，而北至葛瑞福山德社區。 二十世紀前葉在美國極為知名的太空星際樂園即是以康尼島作為主要的腹地，該樂園在二次大戰後開始衰退，並持續荒廢了許久。在最近幾年，康尼島因為凱斯班公園的開幕而重新繁榮起來，凱斯班公園是職棒小聯盟球隊布魯克林旋風的主要球場。旋風隊在當地十分受到歡迎，每季開賽時都會吸引許多球迷到場觀戰。 ..

Anjos da guarda são os anjos que segundo as crenças cristãs, Deus envia no nosso nascimento para nos proteger durante toda a nossa vida. Argumenta-se que a Bíblia sustenta em algumas ocasiões a crença do anjo da guarda: "Vou enviar um anjo adiante de ti para ..

Altay Cumhuriyeti (Rusça: Респу́блика Алта́й / Respublika Altay; Altay Türkçesi: Алтай Республика / Altay Respublika), Rusya'nın en güneyinde yer alan, federasyona bağlı bir özerk cumhuriyet. Orta Asya'da Asya kıtasının coğrafî merkezinin hemen kuzeyinde ve ..

沙羅週期長度為18年11天，本週期包含70次日食，其中公元3000年以前有49次。 註：下表各項數據均為食分最大地點的情況。寬度指該地點食甚時刻月球的本影（全食時）或偽本影（環食時）落在地表的寬度，持續時間指該地點食既到生光的時間，即全食或環食的持續時間，全環食（亦稱混合食）發生時，食分最大處為全食。最後兩項參數不適用於偏食。 本周期最終結束於3378年6月17日。

希西家王 (希伯來語：，英語：）是猶大末年的君主，也是猶大國歷史中極尊重上帝的君王，在位29年。終年54歲。他在位的年份有兩種說法：其一是前715年-前687年；另一種是前716年-前687年。他的德行在其前後的猶大列王中，没有一個能及他。其希伯來名字的意思是“被神加力量”。 希西家的父親亞哈斯是一個背逆上帝的君王。因此在希西家當政之初的猶大國，無論政治，宗教上都极其黑暗。根據《聖經》記載，因为北國以色列被亞述攻滅，亞述王可以趁勢来攻打猶大國；又猶大的先王亞哈斯曾封鎖了聖殿之路，引導舉國崇拜偶像，大大得罪上帝。若非上帝的憐憫，為了堅定向大衛家所說的應許，猶大國的暫得幸存。希西家在二十五歲就登基作王，且正在國家危急之秋，由於行耶和華上帝眼中看為正的事，因而得上帝的憐憫，得以成功脫離亞述大軍的攻擊和一場致死的大病。他樂於聽從當代先知以賽亞的指導，使他為上帝大發熱心。 ..

The OnePlus 2 (also abbreviated as OP2) is a smartphone designed by OnePlus. It is the successor to the OnePlus One. OnePlus revealed the phone on 28 July 2015 via virtual reality, using Google's Cardboard visor and their own app. OnePlus sold out 30,000 units ..

兴隆街镇，是中华人民共和国四川省内江市资中县下辖的一个乡镇级行政单位。 兴隆街镇下辖以下地区： 兴隆街社区、兴松村、玄天观村、三元村、金星村、三皇庙村、双桥村、红庙子村、华光村、高峰村、芦茅湾村、篮家坝村、五马村和解放村。

Национальная и университетская библиотека (словен. Narodna in univerzitetna knjižnica, NUK), основанная в 1774 году, — один из важнейших образовательных и культурных учреждений Словении. Она располагается в центре столицы Любляна, между улицами Турьяшка (Turjaška ..

Mauser M1924 (или M24) — серия винтовок компании Mauser, использовавшихся в армиях Бельгии и Югославии. Внешне напоминают чехословацкие винтовки vz. 24, в которых использовались стандартный открытый прицел, патроны калибра 7,92×57 мм (или 8×57 мм), укороченные ..

第三条道路（英語：），又称新中间路线（Middle Way），是一种走在自由放任资本主义和传统社会主义中间的一种政治经济理念的概称。它由中间派所倡导，是社会民主主义的一个流派，英国工党称其为「现代化的社会民主主义」。它的中心思想是既不主张纯粹的自由市场，也不主张纯粹的社會主義，主张在两者之间取折衷方案。 第三条道路不只单单是走在中间，或只是一种妥协或混合出来的东西，第三条道路的提倡者看到了社会主义和资本主义互有不足之处，所以偏向某一极端也不是一件好事，第三条道路正正是揉合了双方主义的优点，互补不足而成的政治哲学。 ..

**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. It was first used by Zermelo in 1913, to prove that chess has pure optimal strategies.^{[1]}^{[2]}

In the mathematical optimization method of dynamic programming, backward induction is one of the main methods for solving the Bellman equation.^{[3]}^{[4]} In game theory, backward induction is a method used to compute subgame perfect equilibria in sequential games.^{[5]} 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.^{[2]}^{[6]}

Consider an unemployed person who will be able to work for ten more years *t* = 1,2,...,10. Suppose that each year in which he remains unemployed, he may be offered a 'good' job that pays $100, or a 'bad' job that pays $44, with equal probability (50/50). Once he accepts a job, he will remain in that job for the rest of the ten years. (Assume for simplicity that he cares only about his monetary earnings, and that he values earnings at different times equally, i.e., the discount rate is zero.)

Should this person accept bad jobs? To answer this question, we can reason backwards from time *t* = 10.

- At time 10, the value of accepting a good job is $100; the value of accepting a bad job is $44; the value of rejecting the job that is available is zero. Therefore, if he is still unemployed in the last period, he should accept whatever job he is offered at that time.
- At time 9, the value of accepting a good job is $200 (because that job will last for two years); the value of accepting a bad job is 2*$44 = $88. The value of rejecting a job offer is $0 now, plus the value of waiting for the next job offer, which will either be $44 with 50% probability or $100 with 50% probability, for an average ('expected') value of 0.5*($100+$44) = $72. Therefore, regardless of whether the job available at time 9 is good or bad, it is better to accept that offer than wait for a better one.
- At time 8, the value of accepting a good job is $300 (it will last for three years); the value of accepting a bad job is 3*$44 = $132. The value of rejecting a job offer is $0 now, plus the value of waiting for a job offer at time 9. 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. Therefore, at time 8, it is more valuable to wait for the next offer than to accept a bad job.

It can be verified by continuing to work backwards that bad offers should only be accepted if one is still unemployed at times 9 or 10; they should be rejected at all times up to *t* = 8. The intuition is that if one expects to work in a job for a long time, this makes it more valuable to be picky about what job to accept.

A dynamic optimization problem of this kind is called an optimal stopping problem, because the issue at hand is when to stop waiting for a better offer. Search theory is the field of microeconomics that applies problems of this type to contexts like shopping, job search, and marriage.

In game theory, backward induction is a solution concept. It is a refinement of the rationality concept that are sensitive to individual information sets in the extensive-form representation of a game ^{[7]}. The idea of backward induction utilize sequential rationality by identifying an optimal action for each information in a given game tree.

In “Strategy: An Introduction to Game Theory” by Joel Watson, Backward induction procedure is defined as:“The process of analyzing a game from the end to the beginning. At each decision node, one strikes from consideration any actions that are dominated, given the terminal nodes that can be reached through the play of the actions identified at successor nodes.” ^{[8]}.

One drawback of backward induction procedure is that it can be applied to only limited classes of games. The procedure is well defined for any game of perfect information with no ties of utility. It is also well defined and meaningful for game of perfect information with ties. However, it leads to more than one strategy profile. The procedure can be applied to some games with nontrivial information sets but it is unreliable in general. The procedure is best suited to solve games with perfect information. (Watson pg.188)^{[9]}

The backward induction procedure can be demonstrated with a simple example.

The proposed game is a multi-stage game involving 2 players. Players are planning to go to a movie. Currently, there are 2 movies that are very popular, Joker and Terminator. Player 1 wants to watch Terminator and Player 2 wants to watch Joker. The Player 1 will buy a ticket first and tell Player 2 about her choice. Then, Player 2 will buy his ticket. Once they both observe the choices, they will make choices on whether to go to the movie or stay home. Just like the first stage, Player 1 chooses first. Player 2 then makes his choice after observing Player 1’s choice.

For this example, we assume payoffs are added across different stages. The game is a perfect information game.

Normal-form Matrix:

Player 2 Player 1 |
Joker |
Terminator |
---|---|---|

Joker |
3, 5 | 0, 0 |

Terminator |
1, 1 | 5, 3 |

Player 2 Player 1 |
Go to Movie |
Stay Home |
---|---|---|

Go to Movie |
6, 6 | 4, -2 |

Stay Home |
-2, 4 | -2, -2 |

Extensive-form Representation:

Steps for solving this Multi-Stage Game, with the extensive form as see to the right:

- Backward induction starts to solve the game from the final nodes.
- Player 2 will observe 8 subgames from the final nodes to choose to “Go to Movie” or “Stay Home”
- Player 2 will make 4 comparisons in total. He will choose an option with the higher payoff.
- For example, considering the first subgame, payoff of 11 is higher than 7. Therefore, Player 2 chooses to “Go to Movie”.
- The method continues for every subgame.

- Once Player 2 completes his choices, Player 1 will make his choice based on selected subgames.
- The process is similar to Step 2. Player 1 compares her payoffs in order to make her choices.
- Subgames not selected by Player 2 from the previous step are no longer considered by both players because they are not optimal.
- For example, the choice to “Go to Movie” offers payoff of 9 (9,11) and choice to “Stay Home” offers payoff of 1 (1, 9). Player 1 will choose to “Go to Movie”.

- The process repeats for each player until the initial node is reached.
- For example, Player 2 will choose “Joker” because payoff of 11 (9, 11) is greater than “Terminator” with payoff of 6 (6, 6).
- For example, Player 1, at initial node, will select “Terminator” because it offers higher payoff of 11. Terminator: (11, 9) > Joker: (9, 11)

- To identify Subgame perfect equilibrium, we need to identify a route that selects optimal subgame at each information set.
- In this example, Player 1 chooses “Terminator” and Player 2 also chooses “Terminator”. Then, they both chooses to “Go to Movie”.
- The subgame perfect equilibrium leads to payoff of (11,9)

Backward induction is ‘the process of analyzing a game from the end to the beginning. As with solving for other Nash Equilibria, rationality of players and complete knowledge is assumed. The concept of backwards induction corresponds to this assumption that it is common knowledge that each player will act rationally with each decision node when she chooses an option — even if her rationality would imply that such a node will not be reached.’^{[10]}

In order to solve for a Subgame Perfect Equilibrium with backwards induction, the game should be written out in extensive form and then divided into subgames. Starting with the subgame furthest from the initial node, or starting point, the expected payoffs listed for this subgame are weighed and the rational player will select the option with the higher payoff for themselves. The highest payoff vector is selected and marked. Solve for the subgame perfect equilibrium by continually working backwards from subgame to subgame until arriving at the starting point. The marked path of vectors is the subgame perfect equilibrium.^{[11]}

**Backward Induction Applied to the Ultimatum Game**

Think of a game between two players where player 1 proposes to split a dollar with player 2. This is a famous, asymmetric game that is played sequentially called the ultimatum game. player one acts first by splitting the dollar however they see fit. Now, player two can either accept the portion they have been dealt by player one or reject the split. If player 2 accepts the split, then both player 1 and player 2 get the payoff according to that split. If player two decides to reject player 1’s offer, then both players get nothing. In other words, player 2 has veto power over player 1’s proposed allocation but applying the veto eliminates any reward for both players.^{[12]} The strategy profile for this game therefore can be written as pairs (x, f(x)) for all x between 0 and 1, where f(x)) is a bi-valued function expressing whether x is accepted or not.

Consider the choice and response of player 2 given any arbitrary proposal by player 1, assuming that the offer is larger than $0. Using backward induction, surely we would expect player 2 to accept any payoff that is greater than or equal to $0. Accordingly, player 1 ought to propose giving player 2 as little as possible in order to gain the largest portion of the split. player 1 giving player 2 the smallest unit of money and keeping the rest for him/herself is the unique sub game perfect equilibrium. The ultimatum game does have several other Nash Equilibria which are not subgame perfect and therefore do not require backward induction.

The ultimatum game is an illustration of the usefulness of backward induction when considering infinite games; however, the game’s theoretically predicted results of the game are criticized. Empirical, experimental evidence has shown that the proposer very rarely offers $0 and player 2 sometimes even rejects offers greater than $0, presumably on grounds of fairness. What is deemed fair by player 2 varies by context and the pressure or presence of other players can mean that the game theoretic model can not necessarily predict what real people will choose.

In practice, subgame perfect equilibrium is not always achieved. According to Camerer, an American behavioral economist, player 2 “rejects offers of less than 20 percent of X about half the time, even though they end up with nothing.”^{[13]} While backward induction would predict that the responder accepts any offer equal to or greater than zero, responders in reality are not rational players and therefore seem to care more about offer ‘fairness’ rather than potential monetary gains.

See also centipede game.

Consider a dynamic game in which the players are an incumbent firm in an industry and a potential entrant to that industry. As it stands, the incumbent has a monopoly over the industry and does not want to lose some of its market share to the entrant. If the entrant chooses not to enter, the payoff to the incumbent is high (it maintains its monopoly) and the entrant neither loses nor gains (its payoff is zero). If the entrant enters, the incumbent can "fight" or "accommodate" the entrant. It will fight by lowering its price, running the entrant out of business (and incurring exit costs — a negative payoff) and damaging its own profits. If it accommodates the entrant it will lose some of its sales, but a high price will be maintained and it will receive greater profits than by lowering its price (but lower than monopoly profits).

Consider if the best response of the incumbent is to accommodate if the entrant enters. If the incumbent accommodates, the best response of the entrant is to enter (and gain profit). Hence the strategy profile in which the entrant enters and the incumbent accommodates if the entrant enters is a Nash equilibrium consistent with backward induction. However, if the incumbent is going to fight, the best response of the entrant is to not enter, and if the entrant does not enter, it does not matter what the incumbent chooses to do in the hypothetical case that the entrant does enter. Hence the strategy profile in which the incumbent fights if the entrant enters, but the entrant does not enter is also a Nash equilibrium. However, were the entrant to deviate and enter, the incumbent's best response is to accommodate—the threat of fighting is not credible. This second Nash equilibrium can therefore be eliminated by backward induction.

Finding a Nash equilibrium in each decision-making process (subgame) constitutes as perfect subgame equilibria. Thus, these strategy profiles that depict subgame perfect equilibria exclude the possibility of actions like incredible threats that are used to "scare off" an entrant. If the incumbent threatens to start a price war Price war with an entrant, they are threatening to lower their prices from a monopoly price to slightly lower than the entrant's, which would be impractical, and incredible, if the entrant knew a price war would not actually happen since it would result in losses for both parties. Unlike a single agent optimization which includes equilibria that aren't feasible or optimal, a subgame perfect equilibrium accounts for the actions of another player, thus ensuring that no player reaches a subgame mistakenly. In this case, backwards induction yielding perfect subgame equilibria ensures that the entrant will not be convinced of the incumbent's threat knowing that it was not a best response in the strategy profile.^{[14]}

The unexpected hanging paradox is a paradox related to backward induction. Suppose a prisoner is told that she will be hanged sometime between Monday and Friday of next week. However, the exact day will be a surprise (i.e. she will not know the night before that she will be executed the next day). The prisoner, interested in outsmarting her executioner, attempts to determine which day the execution will occur.

She reasons that it cannot occur on Friday, since if it had not occurred by the end of Thursday, she would know the execution would be on Friday. Therefore, she can eliminate Friday as a possibility. With Friday eliminated, she decides that it cannot occur on Thursday, since if it had not occurred on Wednesday, she would know that it had to be on Thursday. Therefore, she can eliminate Thursday. This reasoning proceeds until she has eliminated all possibilities. She concludes that she will not be hanged next week.

To her surprise, she is hanged on Wednesday. She made the mistake of assuming that she knew definitively whether the unknown future factor that would cause her execution was one that she could reason about.

Here the prisoner reasons by backward induction, but seems to come to a false conclusion. Note, however, that the description of the problem assumes it is possible to surprise someone who is performing backward induction. The mathematical theory of backward induction does not make this assumption, so the paradox does not call into question the results of this theory. Nonetheless, this paradox has received some substantial discussion by philosophers.

Backward induction works only if both players are rational, i.e., always select an action that maximizes their payoff. However, rationality is not enough: each player should also believe that all other players are rational. Even this is not enough: each player should believe that all other players know that all other players are rational. And so on ad infinitum. In other words, rationality should be common knowledge.^{[15]}

- ↑ Von E., Zermelo (1913). "Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels" (PDF).
*www.ethz.ch*. Retrieved 2018-12-31. - 1 2 Mathematics of Chess, webpage by John MacQuarrie.
- ↑ Jerome Adda and Russell Cooper, "Dynamic Economics: Quantitative Methods and Applications", Section 3.2.1, page 28. MIT Press, 2003.
- ↑ Mario Miranda and Paul Fackler, "Applied Computational Economics and Finance", Section 7.3.1, page 164. MIT Press, 2002.
- ↑ Drew Fudenberg and Jean Tirole, "Game Theory", Section 3.5, page 92. MIT Press, 1991.
- ↑ John von Neumann and Oskar Morgenstern, "Theory of Games and Economic Behavior", Section 15.3.1. Princeton University Press. Third edition, 1953. (First edition, 1944.)
- ↑ Watson, Joel (2002).
*Strategy: an introduction to game theory*(3 ed.). New York: W.W. Norton & Company. p. 63. - ↑ Watson, Joel (2002).
*Strategy: an introduction to game theory*(3 ed.). New York: W.W. Norton & Company. p. 186–187. - ↑ Watson, Joel (2002).
*Strategy: an introduction to game theory*(3 ed.). New York: W.W. Norton & Company. p. 188. - ↑ http://web.mit.edu/14.12/www/02F_lecture7-9.pdf
- ↑ Watson, Joel (2013).
*Strategy: An Introduction to Game Theory, 3rd Edition*. New York, NY: Norton & Company. pp. 183–203. ISBN 9780393918380. - ↑ Kamiński, Marek M. (2017). "Backward Induction: Merits And Flaws".
*Studies in Logic, Grammar and Rhetoric*.**50**(1): 9–24. doi:10.1515/slgr-2017-0016. - ↑ Camerer, Colin F. (1997). "Progress in Behavioral Game Theory" (PDF).
*The Journal of Economic Perspectives*.**11**(4): 167–188. doi:10.1257/jep.11.4.167. ISSN 0895-3309. JSTOR 2138470. - ↑ Rust J. (2008) Dynamic Programming. In: Palgrave Macmillan (eds) The New Palgrave Dictionary of Economics. Palgrave Macmillan, London
- ↑ Yisrael Aumann (1995-01-01). "Backward induction and common knowledge of rationality".
*Games and Economic Behavior*.**8**(1): 6–19. doi:10.1016/S0899-8256(05)80015-6. ISSN 0899-8256.

© 2019 raptorfind.com. Imprint, All rights reserved.