Game Theory - A Very Short Introduction

Game Theory - A Very Short Introduction

Summary

Here is a summary of "Game Theory: A Very Short Introduction" by Ken Binmore:

• Chapter 1: The name of the game. This chapter introduces game theory as the study of strategic interaction between rational individuals. It explains that a "game" can refer to any situation where people interact, from courtship to economics to international politics. The chapter emphasizes that game theory works best when people behave rationally, though it can also explain the behavior of mindless animals or companies eliminated by market forces if they act irrationally. It also introduces the concept of utility to measure players' preferences and discusses how Nash equilibrium, where all players make the best reply to others' strategies, is a fundamental concept.

• Chapter 2: Chance. This chapter delves into the role of chance and mixed strategies in game theory, where players randomize their choices to keep opponents guessing. It explains that even if players don't consciously randomize, their behavior can be effectively random from an opponent's perspective. The chapter discusses how mixed Nash equilibria arise when players adjust their strategies to make their opponents indifferent between choices, sometimes leading to seemingly paradoxical outcomes like in the Good Samaritan Game or voting scenarios. It also touches upon Von Neumann's minimax theorem, which applies to two-person, zero-sum games and states that players should aim to maximize their minimum possible payoff.

• Chapter 3: Time. This chapter explores games where the timing of moves is crucial, such as Chess or Poker, which can be represented in extensive form as game trees. It introduces backward induction as a method to solve finite games of perfect information by working backward from the end of the game, determining the best choices at each step. The chapter discusses concepts like subgame-perfect equilibrium, where strategies are optimal not just for the whole game but for every possible subgame, and common knowledge, where all players know something, know that everyone else knows it, and so on. It also touches upon the Chain Store paradox, highlighting complexities when a player's rationality is refuted by an unexpected move.

• Chapter 4: Conventions. This chapter discusses how conventions, or commonly accepted ways of behaving, help solve equilibrium selection problems in games with multiple Nash equilibria, like the Driving Game. It introduces Schelling's concept of focal points, which are solutions people tend to converge on based on contextual cues, even without explicit agreement. The chapter emphasizes that many societal rules, including language and money, are conventions that evolved because they coordinate behavior on an equilibrium. It also explores how inefficient conventions can arise and persist, as illustrated by Schelling's Solitaire model of segregation, and discusses social dilemmas like the Tragedy of the Commons, where individual incentives conflict with collective well-being.

• Chapter 5: Reciprocity. This chapter focuses on reciprocity as a key mechanism for sustaining cooperation in repeated interactions. It explains that in indefinitely repeated games, like the Prisoner's Dilemma, cooperative strategies such as GRIM (cooperate until the opponent defects, then defect forever) can form Nash equilibria if players value future payoffs enough. The folk theorem is introduced, suggesting that any mutually beneficial outcome can be supported as an equilibrium in a sufficiently long-term relationship with reliable monitoring and punishment for deviations. The chapter also discusses TIT-FOR-TAT, its successes and limitations, and how emotions like anger can serve as commitment devices to enforce reciprocal behavior.

• Chapter 6: Information. This chapter deals with games of imperfect information, where players do not fully know what has happened or what others know, using the concept of information sets to model this uncertainty. Poker is presented as the archetypal game of imperfect information, where bluffing and reading opponents are key. The chapter explains Harsanyi's contribution of transforming situations with incomplete information (where players may have different types, preferences, or beliefs) into games of imperfect information by introducing a "typecasting" chance move. It also explores how costly signals can be used by players to credibly convey their type or intentions, as in the Handicap Principle observed in biology.

• Chapter 7: Auctions. This chapter introduces mechanism design, the process of creating rules and incentives to align agents' behavior with a principal's goals, particularly in situations with information asymmetry. Auctions are highlighted as a successful application, designed to make bidders reveal their true valuations by putting their money where their mouths are. Various auction types are described, including English, Dutch, first-price sealed-bid, and Vickrey auctions, and the chapter explains the revenue equivalence theorem, which states that under certain conditions, these auction types yield the same average revenue for the seller. The chapter also discusses the "winner's curse" in common-value auctions, where the winner may overpay due to overly optimistic estimates.

• Chapter 8: Evolutionary biology. This chapter applies game theory to evolutionary biology, where fitness (average number of extra children carrying a trait) is analogous to utility, and behavioral traits are strategies. It explains that natural selection can lead to animals behaving as though they are rational players, with replicators (like genes) that confer higher fitness becoming more prevalent. The concept of an Evolutionarily Stable Strategy (ESS) is introduced as a strategy that, if adopted by a population, cannot be invaded by any alternative mutant strategy. The chapter discusses examples like the Hawk-Dove game (and its relation to the Prisoner's Dilemma and Chicken), kin selection (Hamilton's rule explaining cooperation among relatives), and the evolution of cooperation through reciprocal altruism in unrelated individuals.

• Chapter 9: Bargaining and coalitions. This chapter distinguishes between noncooperative game theory (which explains cooperation from strategic choices) and cooperative game theory (which assumes players can make binding agreements). The Nash program aims to bridge this by modeling bargaining itself as a noncooperative game. It introduces the Nash bargaining solution, which predicts outcomes based on players' risk attitudes and the status quo, and Rubinstein's alternating-offers model, which provides a noncooperative foundation for it, emphasizing the role of patience. The chapter also explores coalition formation, discussing concepts like the core (outcomes no coalition can improve upon for all its members) and the Shapley value (an average of a player's marginal contributions to all possible coalitions).

• Chapter 10: Puzzles and paradoxes. This chapter addresses common misunderstandings and fallacies in game theory, often arising when intuition clashes with equilibrium arguments. It debunks several fallacies related to the Prisoner's Dilemma, such as the misapplication of Kant's categorical imperative or the "fallacy of the twins" which wrongly assumes players' choices are not independent. The chapter also tackles Newcomb's paradox, showing its apparent contradiction arises from flawed assumptions about the game structure, and clarifies the surprise test paradox by highlighting the importance of correctly defining the game being analyzed. Finally, it discusses the role of common knowledge and its implications for coordination, as seen in the "three old ladies" puzzle and the Email Game.

Notes

Chapter 1: The name of the game

What is a game?

• A "game" can refer to any situation where people interact, from courtship to economics to international politics
• Game theory is concerned with situations where individuals' choices are interdependent, meaning the outcome for each participant depends not only on their own actions but on the actions of others as well
• Game theory works best when people behave rationally, though it can also explain the behavior of mindless animals or companies eliminated by market forces if they act irrationally.

Essential tools and concepts:

• Payoffs represent the outcomes for players, which don't necessarily have to be monetary.
• The theory of revealed preference - basis for understanding player motivation
• Utility is a way to numerically represent preferences, derived from observing choices rather than making psychological assumptions
• Von Neumann's method for measuring utility by assessing the risks a person is willing to take
• Nash equilibrium is where all players make the best reply to others' strategies, meaning no player has an incentive to unilaterally change their strategy.

The 3 key points:

1. Definition and Scope of Game Theory
2. Rationality, Utility, and Revealed Preference
3. Nash Equilibrium as a Central Concept