Backward induction

From HandWiki
Short description: Process of reasoning backwards in sequence


Backward induction is the process of determining a sequence of optimal choices by employing reasoning backward from the end of a problem or situation to its beginning, choice by choice. It involves examining the last point at which a decision is to be made and identifying the most optimal choice of action at that point. Using this information, one can then determine what to do at the second-to-last point of decision. This process continues backward until the best action for every possible point along the sequence (i.e. for every possible information set) is determined. Backward induction was first utilized in 1875 by Arthur Cayley, who discovered the method while attempting to solve the Secretary problem.[1]

In the mathematical optimization method of dynamic programming, backward induction is a method for solving the Bellman equation.[2][3] 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.

In game theory, a variant of backward induction is a method used to compute subgame perfect equilibria in sequential games.[4] The difference is that optimization problems involve just one decision maker who chooses what to do at each point of time, whereas game theory problems involve the decisions of several players interacting. In this situation it may still be possible to apply a generalization of backward induction, since by anticipating what the last player will do in each situation, it may be possible to determine what the second-to-last player will do, and so on. This variant of backward induction has been used to solve formal games from the very beginning of game theory. John von Neumann and Oskar Morgenstern suggested solving zero-sum, two-person formal games by this method in their Theory of Games and Economic Behavior (1944), the book which established game theory as a field of study.[5][6]

Decision making example

Optimal-stopping problem

A person facing a span of ten years for potential employment opportunities (denoted as times 1, 2, ..., 10) may encounter a choice between two job options: a 'good' job offering a salary of $100 or a 'bad' job providing a salary of $44. Each job type has an equal probability of being offered. Upon accepting a job, the individual will remain in that particular job for the entire remainder of the ten-year duration.

This scenario is simplified by assuming that the individual's entire concern is their total expected monetary earnings, without any variable preferences for earnings across different time periods. In economic terms, this is a scenario with an implicit interest rate of zero and a constant marginal utility of money.

Whether the person in question should accept a 'bad' job can be decided by reasoning backwards from time 10.

  • At time 10, the total earnings from accepting a 'good' job is $100; the value of accepting a 'bad' job is $44; the total earnings from rejecting the job that is available is $0. Therefore, if they are still unemployed in the last period, they should accept whatever job they are offered at that time.
  • At time 9, the total earnings from accepting a 'good' job is 2 * $100 = $200 because that job will last for two years. The total earnings from accepting a 'bad' job is 2 * $44 = $88. The total expected earnings from rejecting a job offer is $0 now plus the value of the next job offer, which will either be $44 with 1/2 probability or $100 with 1/2 probability, for an average ('expected') value of ($100 + $44) / 2 = $72. Therefore, regardless of whether the job available at time 9 is 'good' or 'bad', they should accept it for greater income.
  • At time 8, the total earnings from accepting a 'good' job is 3 * $100 = $300 (it will last for three years); the total earnings from accepting a 'bad' job is 3 * $44 = $132. The total expected earnings from rejecting a job offer is $0 now plus the total expected earnings from waiting for a job offer at time t=9. As concluded above, any offer at time 9 should be accepted and the expected value of doing so is ($200 + $88) / 2 = $144. Therefore, at time 8, total expected earnings are higher if the person waits for the next offer rather than accepting a 'bad' job.

It can be verified by continuing to work backwards that a 'bad' offer should only be accepted if the person is still unemployed at time 9 or time 10; a bad offer should be rejected at any times up through time 8. Generalizing this example intuitively, it corresponds to the principle that if one expects to work in a job for a long time, it is worth picking carefully.

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 a field of microeconomics that applies models of this type to matters such as shopping, job searches, and marriage.

Game theory

In game theory, backward induction is a solution concept that follows from applying sequential rationality to identify an optimal action for each information set in a given game tree. It develops the implications of rationality via individual information sets in the extensive-form representation of a game.[7]

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 a rational player will select the option with the higher payoff for themselves. The highest payoff vector is selected and marked. To solve for the subgame perfect equilibrium, one should continually work backwards from subgame to subgame until arriving at the starting point. As this process progresses, the initial extensive form game will become shorter and shorter. The marked path of vectors is the subgame perfect equilibrium.[8]

This idea of backward induction in game theory can be demonstrated with a simple example.

Multi-stage game

A natural first example 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. 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, in the second stage, they choose whether to go to the movie or stay home. Just like in the first stage, Player 1 chooses first, then Player 2 makes his choice after observing Player 1's choice.

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

Normal-form Matrix:

Stage 1
Player 2

Player 1
 Joker Terminator
Joker 3, 5 0, 0
Terminator 1, 1 5, 3
Stage 2
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:

Extensive form game joker terminator

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

  1. Backward induction starts solving the game from the final nodes.
  2. Player 2 will observe 8 subgames from the final nodes to choose "Go to Movie" or "Stay Home."
    1. Player 2 would make 4 possible comparisons in total. In each case he would choose the option with the highest payoff.
    2. For example, considering the first subgame, payoff of 11 is higher than 7. Therefore, Player 2 would choose "Go to Movie."
    3. The method continues for every subgame.
  3. Once one has determined how Player 2 would choose, one analyzes Player 1's prior choices based on selected subgames.
    1. The process is similar to Step 2. One compares Player 1's payoffs in order to anticipate her choices.
    2. Subgames that would not be chosen by Player 2 in the previous step are no longer considered because they are ruled out by the assumption of rational play.
    3. For example, the choice "Go to Movie" offers a payoff of 9 (9,11) and the choice "Stay Home" offers a payoff of 1 (1, 9). Player 1 would choose "Go to Movie."
  4. The process repeats for each player until the initial node is reached.
    1. For example, Player 2 would choose "Joker" because a payoff of 11 (9, 11) is greater than "Terminator" with a payoff of 6 (6, 6).
    2. For example, Player 1, at initial node, would select "Terminator" because it offers a higher payoff of 11. Terminator: (11, 9) > Joker: (9, 11)
  5. To identify a subgame perfect equilibrium, one needs to identify a route that selects an optimal subgame at each information set.
    1. In this example, Player 1 chooses "Terminator" and Player 2 also chooses "Terminator." Then they both choose "Go to Movie."
    2. The subgame perfect equilibrium leads to a payoff of (11,9)

Limitations

Backward induction 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 games of perfect information with ties. However, in such cases it leads to more than one perfect strategy. The procedure can be applied to some games with nontrivial information sets but it is not applicable in general. It is best suited to solve games with perfect information. If all players aren't aware of the other players' actions and payoffs at each decision node, then backward induction is not so easily applied.[9]

Furthermore, even in games that formally allow for backward induction in theory, it may not accurately predict empirical game play in practice. This can be demonstrated with a second example.

Ultimatum game

See also: Centipede gameA second, more famous example of an asymmetric game consists of two players: Player 1 proposes to split a dollar with Player 2, which Player 2 then accepts or rejects. This is called the ultimatum game. Player 1 acts first by splitting the dollar however they see fit. Next, Player 2 either accepts the portion they have been offered by Player 1 or rejects the split. If Player 2 accepts the split, then both Player 1 and Player 2 get the payoffs matching that split. If Player 2 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.[10]

Considering the choice and response of Player 2 given any arbitrary proposal by Player 1, formal rationality prescribes that Player 2 would accept any payoff that is greater than or equal to $0. Accordingly, by backward induction 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 themselves is the unique subgame-perfect equilibrium. The ultimatum game does have several other Nash Equilibria which are not subgame perfect and therefore do not arise via backward induction.

The ultimatum game is a theoretical illustration of the usefulness of backward induction when considering infinite games, but the ultimatum game's theoretically predicted results do not match empirical observation. Experimental evidence has shown that a proposer, Player 1, very rarely offers $0 and the responder, Player 2, sometimes rejects offers greater than $0. What is deemed acceptable by Player 2 varies with context. The pressure or presence of other players and external implications can mean that the game's formal model cannot necessarily predict what a real person will choose. According to Colin 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."[11]

While backward induction assuming formal rationality would predict that a responder would accept any offer greater than zero, responders in reality are not formally rational players and therefore often seem to care more about offer 'fairness' or perhaps other anticipations of indirect or external effects rather than immediate potential monetary gains.

Economics

Entry-decision problem

A dynamic game in which the players are an incumbent firm in an industry and a potential entrant to that industry is to be considered. 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).

If the incumbent accommodates given the case that the entrant enters, the best response for 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 for 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 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.[12]

Unexpected hanging paradox

Main page: Unexpected hanging paradox

The unexpected hanging paradox is a paradox related to backward induction. The prisoner described in the paradox uses backwards induction to reach a false conclusion. 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.

Common knowledge of rationality

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.[13]

Limited backward induction

Limited backward induction is a deviation from fully rational backward induction. It involves enacting the regular process of backward induction without perfect foresight. Theoretically, this occurs when one or more players have limited foresight and cannot perform backward induction through all terminal nodes.[14] Limited backward induction plays a much larger role in longer games as the effects of limited backward induction are more potent in later periods of games.

A four-stage sequential game with a foresight bound

Experiments have shown that in sequential bargaining games, such as the Centipede game, subjects deviate from theoretical predictions and instead engage in limited backward induction. This deviation occurs as a result of bounded rationality, where players can only perfectly see a few stages ahead.[15] This allows for unpredictability in decisions and inefficiency in finding and achieving subgame perfect Nash equilibria.

There are three broad hypotheses for this phenomenon:

  1. The presence of social factors (e.g. fairness)
  2. The presence of non-social factors (e.g. limited backward induction)
  3. Cultural difference

Violations of backward induction is predominantly attributed to the presence of social factors. However, data-driven model predictions for sequential bargaining games (using the cognitive hierarchy model) have highlighted that in some games the presence of limited backward induction can play a dominant role.[16]

Within repeated public goods games, team behavior is impacted by limited backward induction; where it is evident that team members' initial contributions are higher than contributions towards the end. Limited backward induction also influences how regularly free-riding occurs within a team's public goods game. Early on, when the effects of limited backward induction are low, free-riding is less frequent, whilst towards the end, when effects are high, free-riding becomes more frequent.[17]

Limited backward induction has also been tested for within a variant of the race game. In the game, players would sequentially choose integers inside a range and sum their choices until a target number is reached. Hitting the target earns that player a prize; the other loses. Partway through a series of games, a small prize was introduced. The majority of players then performed limited backward induction, as they solved for the small prize rather than for the original prize. Only a small fraction of players considered both prizes at the start.[18]

Most tests of backward induction are based on experiments, in which participants are only to a small extent incentivized to perform the task well, if at all. However, violations of backward induction also appear to be common in high-stakes environments. A large-scale analysis of the American television game show The Price Is Right, for example, provides evidence of limited foresight. In every episode, contestants play the Showcase Showdown, a sequential game of perfect information for which the optimal strategy can be found through backward induction. The frequent and systematic deviations from optimal behavior suggest that a sizable proportion of the contestants fail to properly backward induct and myopically consider the next stage of the game only.[19]

Notes

  1. ↑ Rust, John (9 September 2016). Dynamic Programming. The New Palgrave Dictionary of Economics: Palgrave Macmillan. ISBN 978-1-349-95121-5. 
  2. ↑ Adda, Jerome; Cooper, Russell W. (2003-08-29) (in en). Dynamic Economics: Quantitative Methods and Applications. MIT Press. ISBN 978-0-262-01201-0. https://books.google.com/books?id=d6MD_DWhqwwC&q=Bellman&pg=PA1. 
  3. ↑ Mario Miranda and Paul Fackler, "Applied Computational Economics and Finance", Section 7.3.1, page 164. MIT Press, 2002.
  4. ↑ Drew Fudenberg and Jean Tirole, "Game Theory", Section 3.5, page 92. MIT Press, 1991.
  5. ↑ MacQuarrie, John. "4, Fundamentals" (in en). Mathematics and Chess. University of St Andrews. https://mathshistory.st-andrews.ac.uk/Projects/MacQuarrie/chapter-4/. Retrieved 2023-11-25. 
  6. ↑ von Neumann, John; Morgenstern, Oskar (1953). "Section 15.3.1.". Theory of Games and Economic Behavior (Third ed.). Princeton University Press. 
  7. ↑ Watson, Joel (2002). Strategy: an introduction to game theory (3 ed.). New York: W.W. Norton & Company. p. 63. 
  8. ↑ Rust, John (9 September 2016). Dynamic Programming. The New Palgrave Dictionary of Economics: Palgrave Macmillan. ISBN 978-1-349-95121-5. 
  9. ↑ Watson, Joel (2002). Strategy: an introduction to game theory (3 ed.). New York: W.W. Norton & Company. p. 188. 
  10. ↑ 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. 
  11. ↑ Camerer, Colin F (1 November 1997). "Progress in Behavioral Game Theory". Journal of Economic Perspectives 11 (4): 167–188. doi:10.1257/jep.11.4.167. https://authors.library.caltech.edu/22122/. 
  12. ↑ Rust J. (2008) Dynamic Programming. In: Palgrave Macmillan (eds) The New Palgrave Dictionary of Economics. Palgrave Macmillan, London
  13. ↑ Aumann, Robert J. (January 1995). "Backward induction and common knowledge of rationality". Games and Economic Behavior 8 (1): 6–19. doi:10.1016/S0899-8256(05)80015-6. 
  14. ↑ Marco Mantovani, 2015. "Limited backward induction: foresight and behavior in sequential games," Working Papers 289, University of Milano-Bicocca, Department of Economics
  15. ↑ Ke, Shaowei (2019). "Boundedly rational backward induction". Theoretical Economics 14 (1): 103–134. doi:10.3982/TE2402. 
  16. ↑ Qu, Xia; Doshi, Prashant (1 March 2017). "On the role of fairness and limited backward induction in sequential bargaining games". Annals of Mathematics and Artificial Intelligence 79 (1): 205–227. doi:10.1007/s10472-015-9481-7. 
  17. ↑ Cox, Caleb A.; Stoddard, Brock (May 2018). "Strategic thinking in public goods games with teams". Journal of Public Economics 161: 31–43. doi:10.1016/j.jpubeco.2018.03.007. 
  18. ↑ Mantovani, Marco (2013). "Limited backward induction". CiteSeerX 10.1.1.399.8991.
  19. ↑ Klein Teeselink, Bouke; van Dolder, Dennie; van den Assem, Martijn; Dana, Jason (2022). "High-Stakes Failures of Backward Induction". https://ssrn.com/abstract=4130176. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Backward_induction&oldid=3377599"