A coordination game is a game theory situation where players get better outcomes by choosing the same strategy or matching each other's actions. In this course, it shows how equilibrium can depend on shared expectations, not just individual best moves.
A coordination game in Game Theory is a situation where your payoff improves when you and the other player choose the same option. The main idea is not conflict, but alignment. If both players pick the same action, the outcome works well for both, and if they pick different actions, both usually do worse.
What makes coordination games stand out is that they can have multiple equilibria. That means there is more than one stable outcome where neither player wants to change strategies on their own. The hard part is not finding a good action in isolation, but figuring out which shared action everyone expects to be chosen.
A simple example is deciding on a meeting point. If both people choose the library, they meet successfully. If one chooses the library and the other chooses the cafe, they miss each other. The game is about matching, not outsmarting the other person.
In game theory classes, coordination games often show up when you compare pure strategies and mixed strategies. A pure strategy is a fixed choice, like always choosing one location. A mixed strategy uses probabilities, which can matter when players are unsure about each other or when there is no single obvious focal point. In some coordination settings, randomizing can describe behavior before players settle on a shared expectation.
You will also see that coordination games are not always perfectly easy. Even when both players want the same result, they still need a way to align. That is why conventions, signals, and shared norms matter. A handshake agreement, a traffic rule, or a platform standard all solve the same basic problem: getting everyone onto the same page.
A useful way to think about the term is this: a coordination game is about choosing the same move, but the real challenge is choosing which same move. That is where equilibria, expectations, and strategic reasoning come in.
Coordination games show one of the biggest ideas in Game Theory, not every strategic problem is about beating the other player. Sometimes the real problem is getting aligned. That changes how you read payoff tables, compare equilibria, and explain why people settle on one outcome instead of another.
This term also connects directly to pure vs. mixed strategies. In a coordination game, a pure strategy can work well if both players expect the same choice, but mixed strategies may describe uncertainty when no shared convention exists yet. That makes the term useful any time you are asked why a certain outcome happens even though more than one outcome could work.
You also use coordination games to explain real-world systems like shared standards, route choices, or group decisions. They help you see how cooperation can happen without one side winning and the other side losing. In that sense, the concept gives you a cleaner way to talk about shared incentives, equilibrium selection, and why expectations matter as much as payoffs.
Keep studying Game Theory Unit 5
Visual cheatsheet
view galleryNash Equilibrium
Coordination games often have more than one Nash equilibrium, since several outcomes can be stable if both players expect the same choice. When you analyze one, you check whether either player would want to switch alone. That is how you tell which coordinated outcomes can hold without extra outside pressure.
Matching Pennies
Matching Pennies is the opposite kind of strategic problem, because one player wants to match while the other wants to mismatch. In a coordination game, both players prefer the same outcome. Comparing the two helps you see the difference between alignment and pure conflict in game theory.
Game Matrix
A game matrix is where coordination games are often shown. The payoffs make it easy to spot which outcomes are better when the players choose the same action and which outcomes fail when they choose different ones. Reading the matrix correctly is usually the first step in finding equilibria.
Pure vs. mixed strategies
Coordination games connect directly to the choice between fixed actions and probabilistic choices. If a clear shared convention exists, a pure strategy may be enough. If players are uncertain about what the other will do, mixed strategies can describe that uncertainty before coordination settles down.
A quiz question or problem set item on coordination games usually asks you to read a payoff matrix, find the outcomes where both players match, and identify the Nash equilibria. You may also be asked to explain why more than one equilibrium can exist, or why a player would need a signal or convention to coordinate. If the course uses short written responses, you might compare a coordination game to a conflict game like Matching Pennies and explain how the players' incentives differ. The main move is to show that the best outcome depends on shared expectations, not just one player's isolated best response.
These two get mixed up because both are two-player strategic games, but the payoffs work in opposite ways. In a coordination game, both players want to choose the same action. In Matching Pennies, one player wants matching and the other wants mismatching, so their incentives directly conflict.
A coordination game is a game where both players do best by choosing the same action.
These games often have multiple equilibria, so the main challenge is deciding which shared outcome everyone will follow.
Coordination games are a natural place to practice reading payoff tables and spotting Nash equilibria.
They connect closely to pure vs. mixed strategies, especially when players are unsure what the other person will do.
The concept explains how conventions, standards, and shared expectations can solve strategic problems.
A coordination game is a strategic situation where players get higher payoffs when they choose the same action. The tricky part is that there can be more than one good outcome, so players have to align on one of them. It is less about beating the other player and more about matching choices.
Because more than one shared outcome can be stable. If both players are already choosing the same strategy, neither usually wants to switch alone, even if another coordinated outcome would also work. That is why expectations matter so much.
In a coordination game, both players want the same result and benefit from matching. In Matching Pennies, the players want opposite results, so one player's gain is the other's loss. That makes Matching Pennies a conflict game, not a coordination game.
Look for payoff cells where both players get better results when they choose the same action. Then check whether those same-action cells are stable, meaning neither player wants to change alone. If several same-action cells work, the game may have multiple equilibria.