---
title: "Nash's Theorem | Game Theory"
description: "Nash's Theorem proves that every finite game has at least one Nash equilibrium, including mixed strategies, so you can analyze stable outcomes in Game Theory."
canonical: "https://fiveable.me/game-theory/key-terms/nashs-theorem"
type: "key-term"
subject: "Game Theory"
unit: "Unit 5"
---

# Nash's Theorem | Game Theory

## Definition

Nash's Theorem says every finite game has at least one Nash equilibrium, even if players must use mixed strategies. In Game Theory, it tells you that a stable outcome exists where no one can improve by changing strategy alone.

## What It Is

Nash's Theorem is the result in Game Theory that guarantees at least one Nash equilibrium in any finite game with a finite number of players and strategies. That means you are not just hoping a stable outcome exists. The theorem says one does, even when the game has no obvious pure strategy solution.

A Nash equilibrium is a set of strategies where each player is already doing the best they can given what everyone else is doing. No one can improve by changing only their own move. Nash's Theorem matters because it proves this idea is not rare or accidental, it is built into the structure of finite strategic games.

The big step is mixed strategies. If a game has no pure strategy equilibrium, players can randomize among actions with certain probabilities. Those probabilities can create equilibrium because each player becomes indifferent between their options. That indifference is what keeps the mixed strategy profile stable.

This is why the theorem shows up right before mixed strategy calculations. In a game like Matching Pennies, there is no pure strategy equilibrium, but Nash's Theorem still guarantees an equilibrium exists once randomization is allowed. You then solve for the exact probabilities that make each player indifferent.

A useful way to think about the theorem is that it does not tell you which strategy people will choose in real life. It tells you that if you model the game correctly, at least one equilibrium answer is there to be found. In class, that often means moving from the game matrix to equations for expected payoffs, then solving for the probability mix that balances the incentives.

## Why It Matters

Nash's Theorem is the reason mixed strategy work in Game Theory feels complete instead of ad hoc. Without it, you could run into games where no stable prediction exists, which would make equilibrium analysis much less useful for economics, politics, or competitive decision-making.

It also changes how you approach problem solving. If a two-player matrix game has no pure equilibrium, you do not stop. You look for a mixed equilibrium, set up the expected payoff equations, and solve for the probabilities that make each player indifferent. That process is a direct application of the theorem.

The theorem also gives meaning to model results. When a mixed equilibrium appears, it is not just a trick from algebra. It is backed by a general existence result, so you know the equilibrium is not something you invented by forcing the numbers to work.

In broader course work, Nash's Theorem helps connect strategy tables, probability, and stable outcomes. It is the bridge between the idea of equilibrium and the actual calculations you do in topics like Matching Pennies or Battle of the Sexes.

## Connections

### Nash Equilibrium

Nash's Theorem is the existence result behind Nash equilibrium. The theorem says at least one equilibrium exists in every finite game, while Nash equilibrium is the actual strategic condition where no player can improve by changing only their own move. When you identify an equilibrium in a matrix game, you are using the concept the theorem guarantees.

### Mixed Strategy

Mixed strategies are how Nash's Theorem stays true in games that do not have a pure strategy equilibrium. Instead of choosing one action every time, players assign probabilities to actions. In calculations, you use those probabilities to make opponents indifferent, which is often the path to the equilibrium the theorem guarantees.

### [Matching Pennies](/game-theory/key-terms/matching-pennies)

Matching Pennies is a classic example where no pure strategy equilibrium exists, so it is a natural place to see Nash's Theorem in action. The equilibrium comes from randomizing, not from a fixed action choice. If you can solve Matching Pennies, you can see why the theorem matters for games that look unstable at first.

### [Brouwer's Fixed-Point Theorem](/game-theory/key-terms/brouwers-fixed-point-theorem)

Brouwer's Fixed-Point Theorem is one of the deeper mathematical ideas behind Nash's existence result. You do not usually compute fixed points directly in a basic game theory class, but the connection explains why equilibrium existence is mathematically guaranteed. It links game theory to topology and helps justify why mixed equilibria must exist in finite games.

## On the AP Exam

A problem set or quiz question will usually give you a payoff matrix and ask whether an equilibrium exists, or ask you to find the mixed strategy equilibrium when no pure one is present. You use Nash's Theorem as the reason you keep looking for a solution instead of assuming the game has none.

If the game is finite, the theorem tells you there is at least one Nash equilibrium. Then the actual work is computing it by setting expected payoffs equal and solving for the probabilities that make each player indifferent. In a matrix game, that often means writing one equation per player and checking that the probabilities are valid.

On short-answer or discussion questions, you may also explain why randomization is not random guessing. It is a stable strategy profile. If the prompt mentions Matching Pennies, Battle of the Sexes, or another game with no pure solution, Nash's Theorem is the idea that justifies the mixed strategy answer you find.

## Nash's Theorem vs Nash Equilibrium

Nash equilibrium is the outcome itself, the strategy profile where no player wants to switch alone. Nash's Theorem is the existence claim that says at least one such equilibrium exists in every finite game. If you mix them up, you might describe the solution condition when the question is really asking why a solution must exist at all.

## Key Takeaways

- Nash's Theorem guarantees at least one Nash equilibrium in every finite game with a finite number of players and strategies.
- The equilibrium can be pure or mixed, so randomization is part of the result, not a workaround.
- When a game has no pure strategy equilibrium, the theorem points you toward mixed strategies and expected payoff calculations.
- The theorem does not tell you which equilibrium is best, only that at least one stable outcome exists.
- In Game Theory, this result is what makes equilibrium analysis work for games like Matching Pennies and other finite strategic interactions.

## FAQs

### What is Nash's Theorem in Game Theory?

Nash's Theorem says that every finite game with finitely many players has at least one Nash equilibrium. That equilibrium may be in pure strategies or mixed strategies. In practice, it tells you a stable strategic outcome exists even when the game looks messy.

### Is Nash's Theorem the same as Nash equilibrium?

No. Nash equilibrium is the stable strategy profile itself, where no player can improve by switching alone. Nash's Theorem is the existence result that guarantees at least one such equilibrium in a finite game.

### Why do mixed strategies matter in Nash's Theorem?

Mixed strategies matter because some finite games have no pure strategy equilibrium. Randomizing over actions can create stability by making opponents indifferent, which is exactly how the theorem guarantees an equilibrium exists in those games.

### How do you use Nash's Theorem in a game theory problem?

If a finite game has no obvious pure equilibrium, you look for a mixed equilibrium instead. You set expected payoffs equal, solve for the probability mix, and check that no player can improve by changing alone. The theorem tells you that this search should lead to at least one solution.

## Related Study Guides

- [5.2 Calculating mixed strategy Nash equilibria](/game-theory/unit-5/calculating-mixed-strategy-nash-equilibria/study-guide/GcBHwIwe8IuvYgcA)

## About This Document

Canonical Fiveable pages are available as Markdown at the same path plus `.md`.

- [llms.txt](https://fiveable.me/llms.txt): index of Fiveable's sections and URL patterns
- [llms-full.txt](https://fiveable.me/llms-full.txt): complete subject and unit listing
- [MCP server](https://fiveable.me/mcp): call Fiveable as tools instead of fetching pages (`https://fiveable.me/api/mcp`)
- [MCP server for AP teachers](https://fiveable.me/mcp/teachers): a teacher's classes, assignments and AP-rubric grading (`https://fiveable.me/api/mcp/teacher`)

## Structured Data

```json
{"@context":"https://schema.org","@graph":[{"@type":"LearningResource","@id":"https://fiveable.me/game-theory/key-terms/nashs-theorem#resource","name":"Nash's Theorem | Game Theory","url":"https://fiveable.me/game-theory/key-terms/nashs-theorem","learningResourceType":"Concept explainer","educationalLevel":"AP® / High School","about":{"@id":"https://fiveable.me/game-theory/key-terms/nashs-theorem#term"},"audience":{"@type":"EducationalAudience","educationalRole":"student"},"dateModified":"2026-07-03T02:21:36.475Z","isPartOf":{"@type":"Collection","name":"Game Theory Key Terms","url":"https://fiveable.me/game-theory/key-terms"},"author":{"@type":"Organization","@id":"https://fiveable.me/editorial#content-team","name":"Fiveable Content Team","url":"https://fiveable.me/editorial","parentOrganization":{"@id":"https://fiveable.me/#organization"},"member":[{"@type":"Person","name":"Amanda DoAmaral","sameAs":["https://www.linkedin.com/in/adoamaral"]},{"@type":"Person","name":"Becky Bahr","sameAs":["https://www.linkedin.com/in/becky-bahr-b52743132"]}]},"publisher":{"@type":"Organization","name":"Fiveable","url":"https://fiveable.me"}},{"@type":"DefinedTerm","@id":"https://fiveable.me/game-theory/key-terms/nashs-theorem#term","name":"Nash's Theorem","description":"Nash's Theorem says every finite game has at least one Nash equilibrium, even if players must use mixed strategies. In Game Theory, it tells you that a stable outcome exists where no one can improve by changing strategy alone.","url":"https://fiveable.me/game-theory/key-terms/nashs-theorem","inDefinedTermSet":{"@type":"DefinedTermSet","name":"Game Theory Key Terms","url":"https://fiveable.me/game-theory/key-terms"}},{"@type":"FAQPage","mainEntity":[{"@type":"Question","name":"What is Nash's Theorem in Game Theory?","acceptedAnswer":{"@type":"Answer","text":"Nash's Theorem says that every finite game with finitely many players has at least one Nash equilibrium. That equilibrium may be in pure strategies or mixed strategies. In practice, it tells you a stable strategic outcome exists even when the game looks messy."}},{"@type":"Question","name":"Is Nash's Theorem the same as Nash equilibrium?","acceptedAnswer":{"@type":"Answer","text":"No. Nash equilibrium is the stable strategy profile itself, where no player can improve by switching alone. Nash's Theorem is the existence result that guarantees at least one such equilibrium in a finite game."}},{"@type":"Question","name":"Why do mixed strategies matter in Nash's Theorem?","acceptedAnswer":{"@type":"Answer","text":"Mixed strategies matter because some finite games have no pure strategy equilibrium. Randomizing over actions can create stability by making opponents indifferent, which is exactly how the theorem guarantees an equilibrium exists in those games."}},{"@type":"Question","name":"How do you use Nash's Theorem in a game theory problem?","acceptedAnswer":{"@type":"Answer","text":"If a finite game has no obvious pure equilibrium, you look for a mixed equilibrium instead. You set expected payoffs equal, solve for the probability mix, and check that no player can improve by changing alone. The theorem tells you that this search should lead to at least one solution."}}]},{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Game Theory","item":"https://fiveable.me/game-theory"},{"@type":"ListItem","position":2,"name":"Key Terms","item":"https://fiveable.me/game-theory/key-terms"},{"@type":"ListItem","position":3,"name":"Unit 5","item":"https://fiveable.me/game-theory/unit-5"},{"@type":"ListItem","position":4,"name":"Nash's Theorem"}]}]}
```