Yale Open Courses ECON 159: Game Theory podcast

Lecture 16 - Backward Induction: Reputation and Duels

0:00
1:15:40
Spola tillbaka 15 sekunder
Spola framåt 15 sekunder
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 question in such games is when; in this case, when to fire. We use two ideas from earlier lectures, dominance and backward induction, to analyze the game. Finally we discuss two biases found in Americans: overconfidence and over-valuing being pro-active.

Fler avsnitt från "Yale Open Courses ECON 159: Game Theory"

  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 24 - Asymmetric Information: Auctions and the Winner's Curse

    1:02:28

    We discuss auctions. We first distinguish two extremes: common values and private values. We hold a common value auction in class and discover the winner’s curse, the winner tends to overpay. We discuss why this occurs and how to avoid it: you should bid as if you knew that your bid would win; that is, as if you knew your initial estimate of the common value was the highest. This leads you to bid much below your initial estimate. Then we discuss four forms of auction: first-price sealed-bid, second-price sealed-bid, open ascending, and open descending auctions. We discuss bidding strategies in each auction form for the case when values are private. Finally, we start to discuss which auction forms generate higher revenues for the seller, but a proper analysis of this will have to await the next course.
  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 23 - Asymmetric Information: Silence, Signaling and Suffering Education

    1:10:36

    We look at two settings with asymmetric information; one side of a game knows something that the other side does not. We should always interpret attempts to communicate or signal such information taking into account the incentives of the person doing the signaling. In the first setting, information is verifiable. Here, the failure explicitly to reveal information can be informative, and hence verifiable information tends to come out even when you don’t want it to. We consider examples of such information unraveling. Then we move to unverifiable information. Here, it is hard to convey such information even if you want to. Nevertheless, differentially costly signals can sometimes provide incentives for agents with different information to distinguish themselves. In particular, we consider how the education system can allow future workers to signal their abilities. We discuss some implications of this rather pessimistic view of education.
  • Yale Open Courses ECON 159: Game Theory podcast

    Missa inte ett avsnitt av Yale Open Courses ECON 159: Game Theory och prenumerera på det i GetPodcast-appen.

    iOS buttonAndroid button
  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 22 - Repeated Games: Cheating, Punishment, and Outsourcing

    1:15:46

    In business or personal relationships, promises and threats of good and bad behavior tomorrow may provide good incentives for good behavior today, but, to work, these promises and threats must be credible. In particular, they must come from equilibrium behavior tomorrow, and hence form part of a subgame perfect equilibrium today. We find that the grim strategy forms such an equilibrium provided that we are patient and the game has a high probability of continuing. We discuss what this means for the personal relationships of seniors in the class. Then we discuss less draconian punishments, and find there is a trade off between the severity of punishments and the required probability that relationships will endure. We apply this idea to a moral-hazard problem that arises with outsourcing, and find that the high wage premiums found in foreign sectors of emerging markets may be reduced as these relationships become more stable.
  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 21 - Repeated Games: Cooperation vs. the End Game

    1:15:18

    We discuss repeated games, aiming to unpack the intuition that the promise of rewards and the threat of punishment in the future of a relationship can provide incentives for good behavior today. In class, we play prisoners’ dilemma twice and three times, but this fails to sustain cooperation. The problem is that, in the last stage, since there is then is future, there is no incentive to cooperate, and hence the incentives unravel from the back. We related this to the real-world problems of a lame duck leader and of maintaining incentives for those close to retirement. But it is possible to sustain good behavior in early stages of some repeated games (even if they are only played a few times) provided the stage games have two or more equilibria to be used as rewards and punishments. This may require us to play bad equilibria tomorrow. We relate this to the trade off between ex ante and ex post efficiency in the law. Finally, we play a game in which the players do not know when the game
  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 20 - Subgame Perfect Equilibrium: Wars of Attrition

    1:15:36

    We first play and then analyze wars of attrition; the games that afflict trench warfare, strikes, and businesses in some competitive settings. We find long and damaging fights can occur in class in these games even when the prizes are small in relation to the accumulated costs. These could be caused by irrationality or by players’ having other goals like pride or reputation. But we argue that long, costly fights should be expected in these games even if everyone is rational and has standard goals. We show this first in a two-period version of the game and then in a potentially infinite version. There are equilibria in which the game ends fast without a fight, but there are also equilibria that can involve long fights. The only good news is that, the longer the fight and the higher the cost of fighting, the lower is the probability of such a fight.
  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 19 - Subgame Perfect Equilibrium: Matchmaking and Strategic Investments

    1:17:08

    We analyze three games using our new solution concept, subgame perfect equilibrium (SPE). The first game involves players’ trusting that others will not make mistakes. It has three Nash equilibria but only one is consistent with backward induction. We show the other two Nash equilibria are not subgame perfect: each fails to induce Nash in a subgame. The second game involves a matchmaker sending a couple on a date. There are three Nash equilibria in the dating subgame. We construct three corresponding subgame perfect equilibria of the whole game by rolling back each of the equilibrium payoffs from the subgame. Finally, we analyze a game in which a firm has to decide whether to invest in a machine that will reduce its costs of production. We learn that the strategic effects of this decision–its effect on the choices of other competing firms–can be large, and if we ignore them we will make mistakes.
  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 18 - Imperfect Information: Information Sets and Sub-Game Perfection

    1:15:57

    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, and use this to construct the normal form (the payoff matrix) of such games. A key idea here is that it is information, not time per se, that matters. We show that not all Nash equilibria of such games are equally plausible: some are inconsistent with backward induction; some involve non-Nash behavior in some (unreached) subgames. To deal with this, we introduce a more refined equilibrium notion, called sub-game perfection.
  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 17 - Backward Induction: Ultimatums and Bargaining

    1:10:44

    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 worth to the other side, then the first offer is for an equal split of the pie and this offer is accepted. But this result depends on those assumptions; for example, bargaining power may depend on wealth.
  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 16 - Backward Induction: Reputation and Duels

    1:15:40

    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 question in such games is when; in this case, when to fire. We use two ideas from earlier lectures, dominance and backward induction, to analyze the game. Finally we discuss two biases found in Americans: overconfidence and over-valuing being pro-active.
  • Yale Open Courses ECON 159: Game Theory podcast

    Lecture 15 - Backward Induction: Chess, Strategies, and Credible Threats

    1:12:38

    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 find that some Nash equilibria are inconsistent with backward induction. In particular, we discuss an example that involves a threat that is believed in an equilibrium but does not seem credible.

Kom åt alla poddsändningar i gratisappen GetPodcast.

Prenumerera på dina favoritpoddar, lyssna på avsnitt offline och få spännande rekommendationer.

iOS buttonAndroid button