Common knowledge in Game Theory is information that every player knows, and knows that everyone else knows too. It matters because that shared awareness changes beliefs, strategy, and equilibrium reasoning.
In Game Theory, common knowledge is information that is publicly known by everyone in the game, and everyone knows that everyone else knows it too. That shared loop of awareness is what makes the term stronger than simple mutual information.
If a fact is only known by one player, or even by several players without public confirmation, it is not common knowledge. A public announcement, open signal, or observed move can create common knowledge because everyone can see the same event at the same time. Once that happens, players can form expectations with much more confidence.
This matters most in strategic settings where your choice depends on what you think other people believe. If everyone knows the payoff table, the rules, or the history of the game, then people can reason from the same starting point. That shared starting point makes coordination easier in some games and makes prediction more precise in others.
Common knowledge is also a big part of backward induction in sequential games. When the structure of the game, the payoffs, and the rationality assumptions are treated as common knowledge, players can reason from the final move back to the first move. Each player asks, "If we both know this, what will the next person do?" and keeps stepping backward through the game tree.
A useful way to think about it is this: ordinary knowledge says "I know," but common knowledge says "We all know, we all know that we know, and we all know that we all know that we know." That sounds repetitive, but in game theory that repetition matters because strategic reasoning depends on what is public, not just what is privately true. A small change from private information to common knowledge can shift the whole predicted outcome of a game.
Common knowledge shows up whenever a game depends on public information instead of hidden information. In sequential games, it supports backward induction because each player can safely reason about later moves from the same public facts. Without that shared foundation, you cannot assume everyone is solving the same problem from the same starting point.
It also helps explain why some outcomes are easy to coordinate on while others break down. If a group all knows the same rule, signal, or announcement, they can coordinate more easily. If even one person is unsure whether everyone else received the message, hesitation can spread and the predicted equilibrium may fail.
This term also clarifies the difference between a game that is merely well informed and one that is strategically transparent. In a classroom exercise, a public announcement can turn a private hint into common knowledge, which often changes how you solve the game. In a written analysis, you may be asked to identify whether a player’s action is based on private belief or on information everyone shares.
Common knowledge is one of the background conditions that makes concepts like Nash equilibrium and equilibrium refinement easier to discuss in real strategic situations. It gives you a way to separate what is actually known from what is only assumed. That distinction is central in game theory because players do not just react to facts, they react to what they think other players know about those facts.
Keep studying Game Theory Unit 6
Visual cheatsheet
view galleryPerfect information
Perfect information means players can see previous moves as they happen, but that is not exactly the same as common knowledge. A game can have visible moves without every relevant fact being publicly confirmed in the stronger "everyone knows that everyone knows" sense. When you analyze a tree, check whether the game only reveals actions or whether the underlying payoffs and rules are also common knowledge.
Backward induction
Backward induction works best when the game’s structure and rationality assumptions are common knowledge. Then each player can reason from the end of the game tree back to the beginning, expecting everyone else to do the same. If that shared awareness breaks down, the backward reasoning can become less reliable as a prediction of real behavior.
Nash equilibrium
Nash equilibrium describes a situation where no player wants to change strategy on their own. Common knowledge often sits in the background of equilibrium analysis because players need shared beliefs about the game in order to form stable best responses. If people do not share the same public understanding, the equilibrium you predict on paper may not match what players actually choose.
Centipede Game
The Centipede Game is a classic place where common knowledge and backward induction collide. The logic of the game says each player should anticipate the next move, then the move after that, all the way to the end. But real players often hesitate because they do not fully trust the shared rationality assumptions that backward induction depends on.
A problem set or quiz may give you a sequential game and ask whether a fact is common knowledge, then ask how that changes the predicted play. Your job is to point to the public information, explain what every player can infer, and show how that shared information affects reasoning at each step. In a game tree, you may need to say why backward induction works only when the relevant facts are common knowledge. In a written response, a strong answer separates private belief, public announcement, and common knowledge instead of treating them as the same thing.
Perfect information and common knowledge overlap, but they are not identical. Perfect information means players observe previous actions in the game, while common knowledge means the public facts about the game are shared by everyone and known to be shared. A game can be perfectly observable without every assumption being common knowledge.
Common knowledge means everyone knows the same fact, and everyone knows that everyone else knows it too.
Public announcements and visible signals are the usual way common knowledge gets created in a game.
Backward induction depends on common knowledge of the game structure and rationality assumptions.
When common knowledge is weak or missing, coordination and prediction become harder.
In Game Theory, the difference between private information and common knowledge can change the equilibrium you predict.
Common knowledge is information that all players know and also know that the others know. In Game Theory, that shared awareness matters because strategy depends not only on facts, but on what each player believes the others know. Public announcements are the clearest way to create it.
Mutual knowledge means everyone knows a fact, but common knowledge adds the recursive layer that everyone knows that everyone knows it. That extra layer matters in strategic reasoning because it lets players trust that the same information is guiding everyone’s choices. Without it, coordination can break down.
Backward induction assumes players share the same understanding of the game and the same logic for solving it. If the end state, payoffs, and rationality are common knowledge, each player can reason backward from the final move. If not, the predicted choice at each step may be less stable.
A teacher announcing the rules of a classroom bargaining game to everyone at once is a simple example. Once the rules are public, every player knows the setup and knows that the others heard it too. That shared start changes how people bargain, coordinate, or refuse to move first.