Microeconomics II (PhD) Tutorial 6, June 25
Andreas Kleiner akleiner@uni-bonn.de
Exercises:
1. Consider a marriage market with strict preferences.
Show: The set of individuals that remain single is the same for all stable matchings.
2. Consider a marriage market with strict preferences.
Show: In the men-proposing deferred acceptance algorithm, truthtelling is a dominant strategy for men.
3. There arei= 1, ...,8 sellers each of one horse andj= 1, ...,10 potential buyers each of one horse in a horse market. All agents’ utility gains in the horse market can be identified with their monetary gains, and the horses are homogeneous goods. The reserve priceciof the sellers and the maximal willingness-to-payhj
of the buyers are known to be given as in the following tables:
c1 c2 c3 c4 c5 c6 c7 c8
10 11 15 17 20 21.5 25 26 and
h1 h2 h3 h4 h5 h6 h7 h8 h9 h10
30 28 26 24 22 21 20 18 17 15
(a) Identify the gains from trade each coalition can achieve.
(b) Show that the existence of two buyer-seller pairs who trade at different prices contradicts the requirements of the core.
(c) Determine the core.
(d) Show that each allocation in the core can be supported by a Walrasian price. (Note that this is the converse of the standard result whereby each Walrasian allocation is in the core!)
4. (a) Consider an assignment game, letx, ybe stable payoff vectors and letube defined by
um= max(xm, ym) ∀m
uw= min(xw, yw) ∀w.
Show: uis also a stable payoff vector.
(b) Show: The set of stable payoff vectors has a minimal and a maximal element.
