Graduate Game Theory: Ultimatum Game with a Rejection Threshold (Tree)

When graduate coursework piles up—especially near deadlines, exams, or project submissions—it helps to have a structured way to approach the material. Online tutoring can keep you on track while you work through the actual problems assigned.

This article presents a graduate-level explanation with clear definitions and a step-by-step framework for reasoning through the method. The emphasis is on correct assumptions, transparent logic, and common points where solutions go wrong. The goal is to make the material usable for homework, exams, and applied project work.

For guided help, see Game Theory Tutoring or the parent page Economics Tutoring. More worked examples are collected in the Economics Post Hub. If you’re stuck on backward induction or subgame perfection, visit Troubleshooting: Theory.

Threshold Preference

Suppose Player 2 rejects any offer $x<3$ and accepts any offer $x\ge 3$ (threshold $t=3$).

Game Tree (Representative Offers)

Offer $x=2$:

Player 2 Accept → $(8,2)$
Player 2 Reject → $(0,0)$

Offer $x=3$:

Player 2 Accept → $(7,3)$
Player 2 Reject → $(0,0)$

Backward Induction

$$ \text{Accept if } x\ge 3, \qquad \text{Reject if } x<3. $$

Player 1 maximizes $10-x$ subject to acceptance, so chooses:

$$ x^*=3, \qquad (\pi_1,\pi_2)=(7,3). $$

$$ (x^*,\text{Accept})=(3,\text{Accept}). $$

Comments

Leave a Reply

Your email address will not be published. Required fields are marked *