Neural Sync Active
Bayesian Games
Registry Synced
Bayesian Games
855 words
4 min read
Reading compass
Now · 🎯 Learning Objectives
Bayesian Games
🎯 Learning Objectives
- Model games of incomplete information using types and beliefs
- Apply Harsanyi transformation to convert incomplete to imperfect information
- Define and compute Bayesian Nash equilibrium (BNE)
- Solve auction and signalling problems
- Understand common prior assumption
8.1 Intuition: What You Don't Know Matters
In many strategic situations, you don't know your opponent's payoffs — their "type." Do they value the item more than you? Are they a tough or soft competitor?
🔑 Key Insight: When you don't know someone's payoffs, you form beliefs about their type, and these beliefs shape your strategy. Real-world examples:
- Auctions: You don't know how much others value the item
- Job market: Employer doesn't know worker's ability
- Price competition: Firms don't know each other's costs
8.2 Formal Definition
A Bayesian game consists of:
- Players: N={1,…,n}
- Types: Θi — private information for player i
- Beliefs: pi(θ−i∣θi) — probability distribution over others' types
- Actions: Ai — available actions
- Payoffs: ui(a1,…,an;θ1,…,θn)
Harsanyi Transformation
Convert incomplete information to imperfect information by adding a move by Nature:
- Nature draws types θ=(θ1,…,θn)
- Each player i observes their own θi but not others'
- Players choose actions simultaneously (Diagram)
8.3 Bayesian Nash Equilibrium
A Bayesian Nash equilibrium is a strategy profile s∗=(s1∗,…,sn∗) where each si∗:Θi→Ai maximises player i's expected payoff given their beliefs:
Key Insight
Each type of each player chooses an action to maximise their expected payoff, taking expectations over the types of other players (who may choose type-contingent strategies).
8.4 Example: Two-Type Entry Game
- Incumbent (Player 2) has either High cost (type H, probability 0.4) or Low cost (type L, probability 0.6)
- Entrant (Player 1) doesn't know which; Incumbent knows its own type Payoffs:
- Entrant: Enter → if Incumbent accommodates (2), if fights (-1). Stay Out → 0.
- Incumbent H: Accommodate Entrant → 1, Fight → 0, No entry → 3
- Incumbent L: Accommodate Entrant → 1, Fight → 3, No entry → 4 Incumbent's strategy (type-contingent):
- Type H: Accommodate (1 > 0)
- Type L: Fight (3 > 1) Entrant's expected payoff from Enter:
- With prob 0.4: Incumbent H accommodates → 2
- With prob 0.6: Incumbent L fights → -1
- Expected: 0.4(2)+0.6(−1)=0.8−0.6=0.2>0 BNE: Entrant enters. Incumbent H accommodates, Incumbent L fights.
8.5 Common Prior Assumption
Players have a common prior over the distribution of types, updated using Bayes' rule after observing private signals.
This means: pi(θ−i∣θi)=p(θi)p(θi,θ−i) where p is the common prior.
8.6 Signalling Games
A signalling game is a dynamic Bayesian game where:
- Sender (informed player) observes type and sends a signal
- Receiver (uninformed player) observes signal and takes action
- Payoffs depend on type, signal, and action
Types of Equilibria
| Type | Description | Does signal convey info? |
|---|---|---|
| Separating | Different types send different signals | Yes — fully revealing |
| Pooling | All types send the same signal | No — no information |
| Semi-separating | Some types separate, some pool | Partial information |
Spence's Education Model
Setup:
- Worker has ability θ∈{L,H} (low/high)
- Worker chooses education level e
- Employer observes e and pays wage w(e) Intuition: If education is less costly for high-ability workers, a separating equilibrium exists where H gets education and L doesn't, and employers pay higher wages to educated workers.
📊 Formula Summary
| Concept | Formula |
|---|---|
| Bayesian NE | si∗(θi)∈argmaxEθ−i[ui(ai,s−i∗(θ−i);θi,θ−i)] |
| Posterior belief | pi(θ−i∣θi)=p(θi)p(θi,θ−i) |
| Separating equilibrium | Different types → different signals |
| Pooling equilibrium | All types → same signal |
✅ Practice Questions
Q1: In the two-type entry game, what if the probability of High-cost incumbent is 0.8 instead of 0.4?
SolutionIncumbent's behaviour unchanged: High cost accommodates, Low cost fights.Entrant's expected payoff from Enter: 0.8(2)+0.2(−1)=1.6−0.2=1.4>0Still enters. The expected payoff is even higher because it's more likely the incumbent will accommodate. Q2: If entering costs 1 (so payoff is 1 if accommodated, -2 if fights), would the entrant enter with p(H)=0.4? SolutionExpected payoff: 0.4(1)+0.6(−2)=0.4−1.2=−0.8<0 Entrant stays out. BNE: Entrant stays out. Incumbent H accommodates (if entered), L fights (if entered). Q3: In Spence's model, what two conditions must hold for a separating equilibrium? Solution
- Incentive compatibility for type L: w(eL∗)−cL(eL∗)≥w(eH∗)−cL(eH∗) — L type prefers its own education
- Incentive compatibility for type H: w(eH∗)−cH(eH∗)≥w(eL∗)−cH(eL∗) — H type prefers its own education
Where cθ(e) is the cost of education for type θ, and w(e) is the wage paid by employers who observe e. Join Discord PreviousFolk TheoremNextSignalling Games