1/30
Comprehensive vocabulary flashcards covering fundamental concepts, terminology, game classifications, and strategic mechanisms in game theory.
Game Theory
A non-calculus method used to predict competitors' actions and outcomes when making strategic decisions, by considering how firms respond to each other using a limited set of choices (discrete choices).
→ Commonly applied to oligopolies.
Player
An economic decision maker in a game.
Move
A choice of action to take next, representing a player's next step in a game.
Nature (in Game Theory)
in game theory, refers to an outside factor or random event that affects the outcome of a game but is not controlled by the players.
Example: A company makes a business decision, but unexpected changes in the economy (such as inflation) affect the outcome.
Strategy
is a complete plan and set of rules that determines a player's actions in different situations, considering possible moves and responses from other players.
(if he does A, I’ll do B, but if he does C …..)
Payoff (Outcome)
The result/benefit or utlity/profit a player receives after a sequence of moves (decisions) in a game.
Nash Equilibrium (NE)
is a situation where each player chooses the best strategy they can, given the strategies chosen by the other players.
→ a stable situation: Nobody can improve their outcome by changing their strategy alone.
if playerB takes action1, then playerA makes response1
if playerB takes action2, then playerA makes response2
Dominant Strategy
is a strategy that is always the best choice for a player, regardless of what the other players choose.
Example:
If Player B chooses Action 1 → Player A chooses Response 1.
If Player B chooses Action 2 → Player A still chooses Response 1.
Player A always chooses Response 1 because it gives them the best outcome regardless of Player B's decision.
Perfect Game
A game in which all prior moves made by all players are known to all participants (e.g., Chess, Checkers, Go, Tic-tac-toe).
Complete Game
A game where all relevant information—including players' utility functions, payoffs, and available moves—is known to all players.
Certain Game
A game that involves no exogenous chance or randomness, such as dice rolls or random card dealing.
One-Period Game
A game where all players move simultaneously, each player makes only one move, and payoffs are awarded at the end of everyone's single move.
Zero-Sum Game
A purely competitive game where one player's gain is exactly equal to another player's loss, meaning payoffs sum to zero (or to 100% / 1) and no mutually beneficial solutions exist.
Pure Strategy
A strategy where a player chooses a single specific action with complete certainty.
Mixed Strategy
A strategy consisting of a set of actions along with specific probabilities assigned to each action.
Nash Equilibrium in Mixed Strategies
A set of probabilities assigned to the possible actions for each player such that each player becomes indifferent to what the other player does.
Prisoner's Dilemma Game
A game where a set of strategies exists that produces the highest total welfare, but individual incentives and natural competitive forces lead players to choose a strategy with a lower-welfare equilibrium (the Nash Equilibrium).
Battle of the Sexes Game
A type of game characterized by having more than one cooperative solution/equilibrium and no prisoner's dilemma, where players prefer coordination over different individual choices.
Maximin Strategy
A decision strategy chosen to minimize potential loss (maximizing the minimum position) rather than maximizing gain, commonly applied when large potential losses are possible, such as in a bank run.
Tit-for-Tat
A credible punishment strategy in an indefinitely repeated game where a player cooperates in the initial period and subsequently mimics the rival's prior move (cooperating if the rival cooperated, deviating if the rival deviated).
Sequential Game
A game represented by a game tree where players take turns moving sequentially—one player moves, the other observes the action, and then responds.
Subgame Perfect Nash Equilibrium (SPNE)
The mistake-free Nash Equilibrium for a sequential game, representing the very best strategies for each player given that the other players have always chosen their best responses at every node.
Backwards Induction
A method used to solve sequential game trees by examining final nodes, selecting the best payoff, rolling it backwards one node at a time while discarding unused paths, until reaching the initial decision node.
Ultimatum Game
A sequential game played in pairs where one player proposes how to divide a sum of money and the second player either accepts (both keep the agreed split) or rejects (neither receives any money).
Limit Pricing
An entry-deterrence strategy where an incumbent firm sets prices below the average cost of competitors to discourage rival firms from entering the market.
Predatory Pricing
An entry-deterrence strategy where a firm sets prices below its own average cost to guarantee it undercuts competitors and drives them out of the market.
Excess Capacity
Investing in more plant and equipment than currently needed to meet market demand, which serves as a credible pre-commitment to rapidly expand output and fight potential entrants.
Product Proliferation
An entry-deterrence practice of introducing many product varieties to fill numerous market niches, thereby reducing available market space for competitors.
First-Mover Advantage
A positional advantage in sequential games where entering or acting first yields superior payoffs by building brand recognition, gaining scale economies, or pre-emptively setting entry barriers.
Second-Mover Advantage
A positional advantage where later entrants benefit from demand created by pioneers, incur lower initial advertising costs, and learn from early movers' mistakes to offer superior products.