Nash equilibrium

Topic: Market Structures, Market Failure and Competition · NCERT: Beyond NCERT

Meaning

A Nash equilibrium is a set of strategies, one for each player, where no player can earn more by changing their own strategy alone, as long as the other players keep their strategies. In simple words, every player is already giving their best reply to what the others are doing, so nobody regrets their choice.

Condition (for every player i): Payoff of i from their equilibrium strategy ≥ Payoff of i from any other strategy, when all other players keep their equilibrium strategies.

It matters because it predicts where a strategic interaction will settle. A strategic interaction is one where your result depends on your own choice and also on what others choose. It explains why cartels break down, why arms races and tariff wars happen, and why the outcome can be bad for everyone even when every player acts rationally.

Explanation

How it works: the "switch alone" test

• Where it applies: in games with few players who depend on each other, such as oligopoly (a market with a few large sellers, like cement, telecom or tyres), bargaining, and international talks.

• A perfectly competitive firm is a price taker (it cannot change the market price). It has no rival to "play against", so Nash equilibrium does not help there.

• The parts of every game:

• Players: the people or firms who decide.
• Strategies: the choices open to each player.

• Payoffs: what each player gets from each combination of choices. They are shown in a payoff matrix, written as (row player, column player).

• How to check any cell of a payoff matrix:

• Ask each player: "If only I switch, do I earn more?"

• If the answer is "no" for every player, that cell is a Nash equilibrium.

• Origin: proposed by John Nash in 1950. He shared the 1994 Nobel Prize in Economics with John C. Harsanyi and Reinhard Selten for their "pioneering analysis of equilibria in the theory of non-cooperative games" [5].

• A non-cooperative game is one where players cannot sign binding agreements. Each player decides for themselves.

Worked example: the cement cartel (prisoner's dilemma)

Two cement firms, A and B, can keep the high cartel price or cut it. Profits are in ₹ crore, shown as (A, B).

	B: Keep high price	B: Cut price
A: Keep high price	(10, 10)	(2, 15)
A: Cut price	(15, 2)	(5, 5)

• Step 1: A's best reply.
• If B keeps: A gets 10 by keeping, 15 by cutting. Cutting is better.
• If B cuts: A gets 2 by keeping, 5 by cutting. Cutting is better.

• So cutting is A's dominant strategy (the best choice whatever the rival does).

• Step 2: B's best reply. The game is symmetric (the same for both), so cutting is dominant for B too.

• Step 3: Test (Cut, Cut) = (5, 5).
• If A alone switches to Keep, A gets 2, which is less than 5. B faces the same choice.

• Neither firm gains by moving alone, so (Cut, Cut) is the Nash equilibrium.

• Step 4: Test (Keep, Keep) = (10, 10).

• If A alone switches to Cut, A gets 15, which is more than 10.

• So (Keep, Keep) is not a Nash equilibrium, even though both firms prefer it.

• Result:

• Joint profit is 20 if they cooperate but only 10 in equilibrium.

• The gain from cheating is 15 − 10 = ₹5 crore. This temptation breaks cartels.

• This game is the prisoner's dilemma, first framed around 1950 by Merrill Flood and Melvin Dresher [6].

Key properties to remember

• It need not be efficient.
• Pareto-efficient means no other outcome can make someone better off without making anyone worse off.

• (5, 5) is a Nash equilibrium, but (10, 10) is better for both firms. So individual rationality can lead to a collectively irrational result.

• Link with dominant strategy:

• If every player has a dominant strategy, playing them together is a Nash equilibrium.

• The reverse is not true. A game can have a Nash equilibrium even when no player has a dominant strategy.

• Number of equilibria:

• A game can have more than one Nash equilibrium. For example, in "which side of the road to drive on", both "everyone drives left" and "everyone drives right" are stable.

• Nash showed that every finite game has at least one equilibrium, if players are allowed to randomise their choices (mixed strategies).

• What can shift the outcome: repeated games.

• In a one-shot game (played once), defection is the equilibrium.
• In a repeated game with no known end, the threat of future punishment can hold cooperation in place.
• Example (cement matrix, 3 rounds, no discounting): always cooperate = 10 + 10 + 10 = 30. Cheat once, then the rival cuts forever = 15 + 5 + 5 = 25. Cheating does not pay (for 10 rounds: 100 vs 60).
• Catch: if the last round is known, both cheat in it. Working backwards, cooperation falls apart. So it needs an uncertain or infinite end.
• Tit-for-tat (cooperate first, then copy the rival's last move) won Robert Axelrod's 1980 tournaments of repeated prisoner's dilemmas with no definite end [6].

In India

Indian competition law works by changing the payoffs so that the Nash equilibrium becomes "confess", not "stay in the cartel".

• Cartels are illegal:
• Section 3(1) of the Competition Act, 2002 bans anti-competitive agreements.
• Section 3(3) covers horizontal agreements (agreements between rivals), including bid-rigging under Section 3(3)(d) [4].

• The Competition Commission of India (CCI) is the regulator that enforces the Act.

• Leniency (lesser penalty) makes confessing the dominant strategy:

• Legal basis: Section 46 of the Competition Act, 2002, read with the CCI (Lesser Penalty) Regulations [1].
• The CCI (Lesser Penalty) Regulations, 2024 were notified on 20 February 2024. They replaced the 2009 regulations [1].
• The Competition (Amendment) Act, 2023 added "Lesser Penalty Plus" (LPP). A firm already seeking leniency in one cartel gets an extra penalty cut if it reports another cartel the CCI did not know about [1].

• Game logic: every cartel a firm belongs to becomes a possible "confession" game, so forming cartels becomes riskier.

• Race to confess: the first confessor gets the biggest reward:

Case	1st applicant	2nd	3rd	Source
Zinc-carbon dry cell batteries	Panasonic: 100%	Eveready: 30%	Nippo: 20%	[2]
Maritime transport (car carriers)	NYK Line: 100%	MOL: 50%	NMCC: 30%	[3]

• Cement bid-rigging:
• The CCI penalised 7 cement companies for bid-rigging in a 2012 tender floated by the Director, Supplies & Disposals, Haryana. The penalty was 0.3% of average turnover over the preceding three years [4].

• The firms included UltraTech (₹68.30 crore), Jaiprakash Associates (₹38.02 crore), ACC (₹35.32 crore) and Ambuja (₹29.84 crore) [4].

• Enforcement scale: the CCI investigated 35 cartel cases in the five years covered by a 2025 PIB release [1].

• Consumer angle: the (Cut, Cut) equilibrium is "bad" for firms but good for buyers because prices are low. Competition law aims to keep firms there.

Don't confuse with

• Dominant strategy: it is best for one player whatever the others do. A Nash equilibrium only needs each strategy to be best given what the others actually chose. Every dominant-strategy outcome is a Nash equilibrium, but not every Nash equilibrium involves dominant strategies.
• Pareto efficiency: it asks whether the outcome is best for society. A Nash equilibrium only asks whether it is stable. In the prisoner's dilemma, (Cut, Cut) is stable but not efficient.
• Cooperative (collusive) outcome: (Keep, Keep) gives the highest joint profit (20). But it is not a Nash equilibrium in a one-shot game, because each firm can earn more by cheating.
• Zero-sum game: one side's gain equals the other's loss. The prisoner's dilemma is not zero-sum: total payoffs are 20 in (Keep, Keep) and 10 in (Cut, Cut).

Prelims Hooks

• Nash equilibrium: no player can gain by changing strategy alone, given what the others do. It need not be Pareto-efficient, which is a common trap.
• 1994 Nobel Prize in Economics: John Nash, John C. Harsanyi and Reinhard Selten, for equilibria in non-cooperative games [5].
• Trap: "Every Nash equilibrium has dominant strategies" is false. The correct link: if all players have dominant strategies, that outcome is a Nash equilibrium.
• In the prisoner's dilemma, "defect/cut price" is dominant for both players, and (Defect, Defect) is the Nash equilibrium. The game was framed around 1950 by Flood and Dresher [6].
• Leniency in India: Section 46, Competition Act, 2002, with the CCI (Lesser Penalty) Regulations, 2024, which replaced the 2009 regulations. Lesser Penalty Plus came from the 2023 amendment [1].
• Tit-for-tat won Axelrod's 1980 tournaments of repeated prisoner's dilemmas [6].

Mains Points

• Using Nash logic to break cartels:
• Staying in a cartel is not stable, because cheating is each member's best reply.
• India's lesser penalty regime (Section 46; 2024 Regulations; LPP under the 2023 amendment) turns silence into a losing strategy [1].
• Graded rewards (100% / 50% / 30% in the maritime case) start a race to confess [3].

• Limit: in concentrated sectors like cement, repeated play supports tacit collusion (firms keep prices high by following each other, with no agreement). Section 3 needs proof of an "agreement", so regulators must rely on market studies, merger scrutiny and leniency applicants. (GS-III: competition policy.)

• Rational players, bad outcomes, and the case for regulation:

• Over-fishing (tragedy of the commons), arms races and climate free riding are all Nash equilibria that are individually rational but waste resources for society.
• Free riding means enjoying a benefit, such as a stable climate (a public good: nobody can be kept from using it, and one person's use does not reduce what others get), without paying the cost.

• This supports state action in cases of market failure, such as quotas, pollution standards and competition law, instead of leaving it only to the market. (GS-III: environment, economy.)

• Institutions as tools for moving to a better equilibrium:

• Retaliatory tariffs (for example, the US-China tariff rounds) and stalled climate talks show nations stuck in bad equilibria.
• The WTO (MFN rule, binding tariff ceilings, dispute settlement) and the UNFCCC (national pledges with review) work like "repeated game" devices. They make defection visible and reward cooperation. (GS-II: international institutions.)

Related concepts

• Game theory
• Zero-sum game
• Positive-sum game
• Dominant strategy
• Prisoner's dilemma

Read more

• Game theory: strategic interaction