Game theory is all about strategic decision-making. It looks at how players interact, make choices, and deal with outcomes in various situations. Understanding key concepts like players, strategies, and payoffs is crucial for grasping the fundamentals of game theory.
This intro to game theory covers essential ideas like equilibrium, rationality, and different game types. We'll explore how games are represented using matrices and trees, giving you a solid foundation for analyzing strategic interactions in various contexts.
Key Concepts in Game Theory
Players, Strategies, and Payoffs
- Players are the decision-makers in a game
- Each player has a set of strategies or actions they can choose from
- A strategy is a complete plan of action specifying what a player will do in every possible situation throughout the game
- Payoffs are the outcomes or rewards that players receive based on the strategies chosen by all players
- Payoffs can be represented numerically (profits, points) or ordinally (rankings)
Equilibrium and Nash Equilibrium
- An equilibrium is a stable state where no player has an incentive to unilaterally change their strategy, given the strategies of the other players
- Nash equilibrium is a key concept in game theory
- Defined as a set of strategies, one for each player, such that no player has an incentive to change their strategy given what the other players are doing
- In a Nash equilibrium, each player's strategy is a best response to the strategies of the other players
- Nash equilibrium can be pure (players choose a single strategy) or mixed (players randomize over multiple strategies)
- Example: In the classic Prisoner's Dilemma game, the Nash equilibrium is for both players to defect, even though mutual cooperation would yield higher payoffs
Rationality in Game Theory
Assumptions of Rationality
- Rationality in game theory assumes that players are self-interested and aim to maximize their own payoffs
- Players are assumed to have complete information about the game structure, available strategies, and potential payoffs for all players
- Rational players are expected to make decisions based on logical reasoning and strategic thinking, considering the actions of other players
- Common knowledge of rationality assumes that all players are rational, and all players know that all players are rational, and so on
- This assumption allows players to anticipate and reason about the actions of others
Bounded Rationality
- Bounded rationality recognizes the limitations of human decision-making
- Suggests that players may not always make optimal choices due to cognitive constraints, limited information, or computational complexity
- Players may use heuristics or rules of thumb to simplify decision-making in complex situations
- Satisficing is a decision-making strategy where players seek a satisfactory solution rather than an optimal one
- Example: In a complex business environment, managers may make decisions based on limited information and time constraints, rather than exhaustively analyzing all possible options
Game Types: Simultaneous vs Sequential
Simultaneous Games
- Simultaneous games, also known as static games, are those in which players make their decisions simultaneously or without knowing the actions chosen by other players
- In simultaneous games, players cannot observe the actions of others before making their own decisions
- The outcome is determined by the combination of all players' choices
- Simultaneous games are often represented using the normal form or payoff matrix
- Example: The classic game of Rock-Paper-Scissors is a simultaneous game, where both players choose their action at the same time
Sequential Games
- Sequential games, also known as dynamic games, are those in which players make their decisions in a specific order
- Some players observe the actions of others before making their own choices
- The order of play and the information available to players at each decision point are crucial factors in determining the game's outcome
- Perfect information games are sequential games in which all players have complete knowledge of the previous actions taken by other players at each decision point
- Sequential games are often represented using the extensive form or game tree
- Example: Chess is a sequential game with perfect information, where players alternate turns and can observe all previous moves
Game Representation: Matrices and Trees
- Normal form representation, also known as the strategic form, represents a game using a matrix that shows the players, their strategies, and the corresponding payoffs for each combination of strategies
- In a normal form matrix, each row represents a strategy for one player, and each column represents a strategy for the other player
- The payoffs for each player are listed in each cell of the matrix, typically with the row player's payoff listed first
- Normal form is useful for analyzing simultaneous games and identifying Nash equilibria
- Example: The Prisoner's Dilemma can be represented in normal form, with each player having two strategies (Cooperate or Defect) and the resulting payoffs for each combination of strategies
- Extensive form representation, also known as the game tree, represents a game as a tree-like structure that shows the sequence of moves, decision points, and payoffs
- In an extensive form game tree, nodes represent decision points for players, edges represent actions or moves, and terminal nodes represent the outcomes and payoffs for each combination of strategies
- Game trees allow for the representation of sequential moves, imperfect information, and subgame perfect equilibria
- Subgame perfect equilibria are Nash equilibria in every subgame of the extensive form game
- Information sets in game trees represent situations where players have the same information and available actions
- Example: The Ultimatum Game can be represented as an extensive form game tree, with the proposer choosing an offer and the responder deciding whether to accept or reject the offer at each decision node