Perfect information games

Perfect information games are games in Intermediate Microeconomic Theory where every player observes all earlier moves and knows the game structure. That full visibility makes the game tree easier to solve, often with backward induction.

What are perfect information games?

Perfect information games are sequential games in which every move is visible to every player when it is made, so no one has hidden actions or hidden history. In Intermediate Microeconomic Theory, that means you can trace the game one node at a time and figure out what each player will do after seeing what came before.

The structure matters as much as the players’ preferences. Because the order of moves is known, you do not solve the game by asking only what happens at the same time. You solve it by looking at the decision tree, asking what the last mover would do in each possible situation, and then working backward from there.

That is why perfect information games are often paired with backward induction. You start at the final decision node, choose the best action for the player moving last, then move one step earlier and ask what the earlier player anticipates. Each player is assumed to understand the later responses that their own move will trigger.

A classic example is chess. Each player sees all previous moves, the rules are public, and there is no hidden card, hidden signal, or secret action. Checkers works the same way. In contrast, poker is not a perfect information game because players do not see opponents’ cards, so the strategic problem includes uncertainty about hidden information.

In microeconomics, perfect information games show up whenever timing gives one firm, buyer, or seller an observed move before the other side responds. For example, a firm might set a price first and a rival reacts later, or an incumbent might choose capacity before a potential entrant decides whether to enter. The clean visibility of the move history is what makes the game “perfect information,” not whether the outcome is simple.

Why perfect information games matter in Intermediate Microeconomic Theory

Perfect information games are the bridge between basic Nash equilibrium and the sharper logic of sequential choice. In Intermediate Microeconomic Theory, they give you a way to analyze situations where the order of actions changes the outcome, like price competition, entry deterrence, bargaining, or any decision tree where later players react to earlier moves.

This term matters because it teaches you to think about credibility. A player can announce a threat or promise, but if the game is perfect information, you can check whether that action would still make sense when the moment arrives. That is exactly why backward induction is so useful. It strips away threats that sound strategic but would never be carried out once the player actually reaches the node.

It also helps you read game trees correctly. A student who can spot a perfect information structure knows when to trace payoffs from the end of the tree to the beginning, when to compare branches, and when an observed move changes the opponent’s next best response. That skill shows up in problem sets and in short-answer questions about sequential behavior.

The concept also sets up the next step in the course. Once you can solve perfect information games, you can see why hidden actions or hidden information complicate the analysis. That contrast makes information itself feel like an economic variable, not just a background detail.

How perfect information games connect across the course

Backward induction

Backward induction is the main solving method for perfect information games. You begin with the final mover’s best choice, then move backward through earlier decision nodes and choose the action that anticipates those future responses. If you miss this logic, you may pick an outcome that looks good at the start of the game but would not survive when players actually reach later stages.

Game Tree

A game tree is the picture you use to represent a perfect information game. Each branch shows a possible action, and each node shows a point where a player makes a decision after observing previous moves. If the tree is drawn correctly, it becomes much easier to identify what each player knows and where backward induction starts.

Subgame perfect equilibrium

Subgame perfect equilibrium is the equilibrium concept that fits perfect information games especially well. It requires strategies to be optimal not just in the whole game, but in every subgame too, which rules out noncredible threats. In practice, if you solve a perfect information game correctly, you are usually checking whether the outcome is subgame perfect.

Information Sets

Information sets mark what a player cannot distinguish in a game. Perfect information games are the special case where each decision node is fully observed, so every information set contains only one node. When information sets group several nodes together, the game is no longer perfect information and the analysis changes.

Are perfect information games on the Intermediate Microeconomic Theory exam?

A quiz or problem set will usually show you a game tree and ask whether it is a perfect information game, then have you solve it step by step. Your job is to identify what each player knows at each node, work backward from the end, and state the resulting strategy profile or outcome. If the game has observed moves and no hidden actions, that is the cue to use backward induction rather than treating it like a simultaneous-move problem.

You may also get a short scenario and need to decide whether the structure is perfect information. Look for whether later players can see earlier choices and whether the rules and payoffs are common knowledge. If the game includes hidden cards, private signals, or unobserved actions, then it is not perfect information.

Perfect information games vs imperfect information games

Perfect information games let every player observe all previous moves and know the full structure of the game. Imperfect information games have at least one hidden action, hidden payoff-relevant fact, or decision node that a player cannot fully distinguish. That difference changes the solution method, because perfect information games are usually handled with backward induction, while imperfect information often requires information sets and beliefs.

Key things to remember about perfect information games

• Perfect information games are sequential games where every player can see all earlier moves and knows the game structure.

• Because the history is visible, you usually solve these games with backward induction from the last move back to the first.

• Chess and checkers are standard examples, while poker is not a perfect information game because of hidden information.

• In microeconomics, the term shows up in entry games, bargaining, pricing sequences, and other situations where timing and observation shape strategy.

• The concept sets up subgame perfect equilibrium by filtering out threats and promises that would not be credible when the game reaches them.

Frequently asked questions about perfect information games

What is perfect information games in Intermediate Microeconomic Theory?

Perfect information games are sequential games where each player sees all previous moves and knows the full rules and payoffs. In Intermediate Micro, that makes the game tree fully observable, so you can solve it by tracing choices backward from the end. The key idea is not just order, but complete visibility of the earlier history.

How do perfect information games differ from imperfect information games?

In perfect information games, no player is hiding an action or payoff-relevant fact from the others, so each move is observed as it happens. In imperfect information games, someone lacks full knowledge, like not knowing an opponent’s card, type, or past choice. That hidden information changes how you analyze the game and often adds beliefs to the problem.

How do you solve a perfect information game?

You usually solve it with backward induction. Start at the last decision node, choose the action that gives that player the best payoff, then move backward one step at a time and ask what each earlier player expects the later player to do. This gives you the outcome that survives each player’s best response at every stage.

Is chess a perfect information game?

Yes, chess is a classic perfect information game because both players can see all moves that have been made and the full board position at every stage. That makes it a clean example for thinking about sequential strategy. It is useful for microeconomics because it shows how visible history changes decision making.