Backward Induction
sort by: Relevancy | Title | Rating try advanced search for more options
-
In the first part of the lecture we wrap up the previous discussion of implied default probabilities, showing how to calculate them quickly by using the same duality trick we used to compute forward interest rates, and showing how to interpret them as spreads in the forward rates. The main part of the lecture focuses on the powerful tool of backward induction, once used in the early 1900s by the mathematician Zermelo to prove the...more
-
We first discuss Zermelo's theorem: that games like tic-tac-toe or chess have a solution. That is, either there is a way for player 1 to force a win, or there is a way for player 1 to force a tie, or there is a way for player 2 to force a win. The proof is by induction. Then we formally define and informally discuss both perfect information and strategies in such games. This allows us to find Nash equilibria in sequential games. But we...more
-
We first apply our big idea--backward induction--to analyze quantity competition between firms when play is sequential, the Stackelberg model. We do this twice: first using intuition and then using calculus. We learn that this game has a first-mover advantage, and that it comes commitment and from information in the game rather than the timing per se. We notice that in some games having more information can hurt you if other players know...more
-
In the first half of the lecture, we consider the chain-store paradox. We discuss how to build the idea of reputation into game theory; in particular, in setting like this where a threat or promise would otherwise not be credible. The key idea is that players may not be completely certain about other players' payoffs or even their rationality. In the second half of the lecture, we stage a duel, a game of pre-emption. The key strategic...more
-
We develop a simple model of bargaining, starting from an ultimatum game (one person makes the other a take it or leave it offer), and building up to alternating offer bargaining (where players can make counter-offers). On the way, we introduce discounting: a dollar tomorrow is worth less than a dollar today. We learn that, if players are equally patient, if offers can be in rapid succession, and if each side knows how much the game is...more
-
This lecture is about optimal exercise strategies for callable bonds, which are bonds bundled with an option that allows the borrower to pay back the loan early, if she chooses. Using backward induction, we calculate the borrower's optimal strategy and the value of the option. As with the simple examples in the previous lecture, the option value turns out to be very large. The most important callable bond is the fixed rate amortizing...more
-
The class's examination of Nozick's minimal state has raised a number of important questions, most of which are rooted in his troublesome model of compensation. Nozick would respond with his threefold account of justice: (1) justice in acquisition, (2) justice in transfer, and (3) rectification of past injustices. Nozick brilliantly demonstrates that "liberty upsets patterns"--even though we can originally start off with any just...more
-
-
In this lecture we move from present values to dynamic present values. If interest rates evolve along the forward curve, then the present value of the remaining cash flows of any instrument will evolve in a predictable trajectory. The fastest way to compute these is by backward induction. Dynamic present values help us understand the returns of various trading strategies, and how marking-to-market can prevent some subtle abuses of the...more
-
-
This course is an introduction to game theory and strategic thinking. Ideas such as dominance, backward induction, Nash equilibrium, evolutionary stability, commitment, credibility, asymmetric information, adverse selection, and signaling are discussed and applied to games played in class and to examples drawn from economics, politics, the movies, and elsewhere.
-
We consider games that have both simultaneous and sequential components, combining ideas from before and after the midterm. We represent what a player does not know within a game using an information set: a collection of nodes among which the player cannot distinguish. This lets us define games of imperfect information; and also lets us formally define subgames. We then extend our definition of a strategy to imperfect information games,...more
