=
22.F.3.
f
Sl
•
1
n r o = o. n
•
(a)
•
~
(v+v') =
n(i)}) + v'({h
I
n(h) :!> n(i)}) -
n - v({hl n(h)
<
n(i)})- v'({hl n(h)
<
n(i)})}
n(h) :£ n(i)}) - v'({h I n(h)
<
n(i}})) =
n = f
Sl
(v') +
f
Sl
(v').
(b) Suppose that the agents do not know which of the two bargaining situations
v and v' will occur, and they expect each situation to occur with probability 1/2. Linearity of a bargaining solution then implies that the agents are indifferent as to whether the solution is applied before or after uncertainty is resolved: E- f V
I
(v)
= 1/2 f (v) + 1/2 f I
(vI) 1
•
=
(by IUU) = f {1/2v) + f {1/2 v') = = f (1/2v + 1/2 v') = f I
22.F.4.
I
1
(a) Let v be a T-unanimity game, where Tci.
and each Sci we have •
22-36
I
(Ev).
Then for each t
E
I\T
v(I), TcS
=
v(Sv{i})
•
= v(S). 0 otherwise
Therefore, by the dummy axiom, f (v) = 0 for each i e I\T. By the Pareto l
property, •
r
•
fl(v)
= r
leT
= v(l) .
f."ll)
iei\T
Sincy by summetry we must have f
• f (v) for each t,j e T, we must have
l ( v)
J
f (v) = 1/ITI v(I) for each i e T. 1
•
•
(b) Let v, v' be any two TU characteristic form games on the set I of agents, and ex. be a real number. Then we can define two new TU characteristic function games on I, v+v' and o:v, so that for any Sci, (v+v')(S) (a.v )(S)
= v(S) + v'(S).
•
= cx.v(S).
It is easy to check that with addition and multiplication by a real number defined as above, the set of TV characteristic function games is a linear
•
space, which we will denote as V. Since a TU characteristic function game
v
v is described
For any Tel, define the normal T-u.nanimity game v •
T
by
•
1, TcS
0 otherwise.
We are going to show that normal unanimity games constitute a basis in V. 1
First, there are 21 I different normal unanimity games. Second, we will •
show that normal unanimity games are linearly independent, i.e. that for any 0:
.IR2 E
I
such that
L o:T Tci
v (S) = T
t
o:
1
=0
'f/S, we must have o:
1
=0
VTci.
TcS
We will show this by induction on the number of elements in T. Setting 5=0,
22-37
•
E a:T· = a:~ = 0.
we find
Further, suppose that a:
T
=0
for all Tel such that
Tc0 •
•
IT I s k < I I 1. Then, for any Sci such that IS I = k
+
1, we must have
•
a:
s
L
+
a:T
=a:
s
+0=
a: = 0,
s
TcS, IT l ::sk+l i.e. the statement is true for all subsets of I containing k+l elements. By induction, a:T = 0 'dTci, which proves linear independence of normal •
•
unanimity games. Now it is easy to prove that weak linearity of a cooperative solution f( ·) implies its linearity. Weak linearity of f( ·) means that for any
unanimity game v and any v' e V, f(v) + f(v') = f(v+v' ). Now, take instead any two characterestic function games v, v' v' e V. Let a: e IR
21
be the
coordinates of v in the basis of normal unanimity games, i.e. let
v =
[ a:
T
v . Since a: T
T
v
T
is a unanimity game for all Tci, we can use
Tci
weak linearity iteratively to obtain
Tel
Tci
v ) + f(v') = f(v) + f(v' ), T
i.e. f(•) is linear.
(c) It is straightforward to check that the Shapley value satisfies all the mentioned properties. Here we will show that any cooperative solution f( · ) which satisfies all the mentioned properties coincides with the Shapley
i IR
value. Take any characteristic function game v, and let a: e
coordinates of v in the basis of normal unanimity games, i.e .
•
•
22-38
be the
v =
r '\
VT. Using linearity,- invariance to common changes of utility units,
Tel
and the result of part (a), we can write
L fl(a.T
fl(v) =
VT) =
Tel
L a.T
L
fl(vT) =
L
a.T fl(vT) =
I
I
Tel leT
Tel
cx.,JITI.
Tel leT
Now we can show that f( ·) satisfies Definition 18.AA. 7 of the Shapley value in •
•
Appendix A to Chapter 18 of the textbook (p.681). For this purpose. we define •
IT I. Clearly. f
(v) =
1
f (l,v), and it thus remains to show I
Tesj ieT •
that f (S,v) satisfies both conditions of U8.AA.2). To see that the first l
condition (preservation of utility differences) is satisfied, take any •
S e I and any i,h e S, and observe that /
(S,v) / (5\{h},v) 1 1
=
L
L
a.T/ITI -
=
a.T/ITI
Tc:S\fh) I ieT
Tc:SI ieT
L
a.T/ITI.
TeSj f i ,h)cT
Since the last expression is symmetric in i and h, it is clear that
f 1(S,v) - f
(<=\. {h},v) =
.... ,
f h (S,v) - f h (S\{i},v), i.e. utility differences are
preserved. To see that the second (adding up) condition is satisfied, take any S e I and observe that
I: ieS
ieS
a.r/ITI =
TcSI LeT
I:
ITI a.
ITI =
r
a.T
TcS
Tc.S
= r
c..T VT(S)
= v(S).
Tel
•
•
(We have reduced the double summation to a single sum, noting that each set TcS is encountered IT I times in the double summation. The last equality follows from the defintion of a. as the vector of coordinates of v in the basis of normal unanimity games.) Therefore, f (S,v) satisfies both parts I
of (18.AA.2), and f( ·) coincides with the Shapley value as defined in Definition 18.AA.7. For the relation between this and other definitions of Shapley value, see e.g. A. Mas-Colell and S. Hart, "Potential, Value, and Consistency", Econometrica 1989, 57(3), p.589(26).
22-39
•
22.F .5.
Suppose in negation that the two lowest excesses are not equal.
(a)
Without loss of generality, suppose that e(u,{l.2}) < e(u,{l,3}) = m (u)
e(u,{2,3}) • m (u).
:!:
2
(1)
I
(The individuals could always be renumbered to obtain this.) First, we show that u + u 1
> 0.
2
Indeed, suppose in negation that u + u 1
•
-
feasibility of the utility profile we must have u definition of excesses,
3
2
= 0, then by exact
= v(l). Then using the
by (1) we must have
e(u,{l,2}) = v0,2} < e(u,{l,3}}
= v(l,3)
This implies that v(l) < v(l,3) - v(1,2)
~
- v(l).
v(1,3), which contradicts the
assumption that v(S) :s v(l) for any coalition S. Therefore, we must have either u > 0, or u I
> 0, or both.
2
When u > 0, take a new exactly feasible utility point I
u' = (u -
£,
e(u' ,{2,3})
= m I (u)
1
u , u 2
+ £),
3
-
£,
e(u' ,{1,2}) = e(u,{l,2})
m (u) -
£
:!:
1
where
1
= m 2 (u)
e(u' ,{1,3})
+ £
:s m (u), and that 1
•
< min{e(u' ,{2,3}), e(u' ,{1,3})}. If -
m (u), the above implies that 2
= e(u' ,(2,3}) = m 1(u)
m (u')
> 0 is small enough. Then we know that
£
-
£
< m (u), I
which contradicts the assumption that u' is in the nucleolus. If, instead,
m (u) -
£
1
< m (u), the above implies that 2
m (u') = e(u' ,{1,3}} = m (u) :s m (u), 1
2
m (u') 2
= e(u' ,{2,3}) = .m I (u)
I
-
£
<m
2
(u),
which again contradicts the assumption that u' is in the nucleolus. When u 2 > . 0, take a new exactly feasible utility point
u' = (u , u I
2
-
£,
u
3
+ £),
where
> 0 is small enough.
£
e(u' ,{2,3}) = m (u), e(u' ,{1,3}) = m (u) 1
e(u' ,{1,2})
2
= e(u,{l,2})
+
£
£
Then we know that
< m (u), and that 1
< min{e(u' ,(2,3}), e(u' ,{1,3})}. -
•
22-40
This
implies that m (u') = e(u' ,{2,3}) • m (u}, and 1'
1
m Cu') = e(u' ,(1,3}) = m (u) -
£
2
2
<m
2
This contradicts the assumption
(u).
that u' is in the nucleolus. Therefore, we have shown that in all cases (1) contradicts the assumption that u' is in the nucleolus. •
(b)
Suppose that the nucleolus contains t"YO utility profiles, u and u'. If u
is In the nucleolus, by definition of the nucleolus we must have m (u) 1
m (u') 1
m (u' ).
:!:
Symmetrically, if u' is in the nucleolus, we must have
1
~
m (u).
Therefore, If both utility profiles are in the nucleolus, we
I
must have •
= m 1(u' ).
m (u) 1
(2.1)
•
•
Using (2.1) fact and the fact that u is in the nucleolus, we must have m (u) :s m (u' ). Symmetrically, using (2.1) and the fact that u' is in the 2
2
nucelolus, we must have m (u') :s m (u). 2
2
Therefore, if both utility profiles
are in the nucleolus, we must also have m (u) 2
= m (u' ). 2
(2.2)
•
•
Now we are going to show that there exists a two-agent coalition S such that m (u) = e(u, 5) 1
true.
= m 1(u') = e(u',
Sl..
Suppose in negation that this is not
For definiteness, suppose that •
m (u)
= e(u,
m (u')
= e(u', {1,3}) = m (u)
1 1
{1,2}}
=
m (u') 1
1
>
e(u', {1,2})
= e{u',
>
e(u, {1,3})
= e(u, {2,3}),
{2,3}),
where the last equality in each line follows from the result of part (a) . •
Now, take u' '· = 1/2 u
+
1/2 u'.
Using linearity of the excesses in utility
profiles, and the above relations, we can write e(u' ', {1,2})
= 1/2 e(u,
{1,2}) + 1/2 e(u', {1,2}) < •
= m (u), 1
•
• • •
•
22-41
e(u'
1
= 1/2 e(u,
{1,3})
,
<
{1,3}) + 1/2 e(u', {1,3}) •
< 1/2 e(u'
m (u) + 1/2 m (u I
1
)
1
= m 1(u),
1 1/2 e{ ul {213}) + 1/2 e( u_ I {2,3}}
'1 {2,3}) =
< 1/2
<
m (u) + 1/2 m (u') = m (u). I
•
.
I
I
This implies that m (U 1
1 1
)
= max{e(u' 'I
{112}), e(u' ', {1,3}), e(u' 'I {213})} < m (u), 1
which contradicts the assumption that u is in the nucleolus.
Therefore, we
there must exist a two-agent coalition 5 such that m (u) I
=
e(u, Sl
=
m (u') I
=
•
e(u', S).
For definiteness, suppose that S = {1,2}, I.e. m (u) 1
= m 1(u') = e(ul
{1,2}) = e(u', {1,2}). •
Using the definition of excesses, this can be rewritten as u
1
+ u
2
=
U
1
1
+
1
U
{3.1)
•
2
Equation (2.2), together with the result of part (a), implies that •
m
2
= m
(u)
2
(u'}
=
e(u, {1,3})
=
e(u, {2,3}) =
•
= e(u', (1,3}) = e(u', {213}). Using the definition of excesses, these equalities imply that u
1
+
u
3
= u'
u'.
(3.2)
= ul + ul.
(3.3)
1
+
3
2
3
Equations (3.1), (3.2), and (3.3) together imply that u = u'. Therefore, the nucleolus cannot contain two different utility profiles. Suppose for definiteness that v(1,2) = v(l,3). We are going to show that
(c)
in that case u u
2
*
2
= u
3
at the nucleolus solution.
u . Define u' = (u , u , u ) 3
I
3
e(u, {1,2}) = v(1,2) - u
e(u, {1,3} l = v(l,3) - u
I I
2
- u - u
2 3
*
Suppose in negation that
u. We then have
= v(l,3) - u'
- u'
= e(u',{l,3}),
= v(l,2) - u'
- u'
= e(u' ,{1,2}),
I I
•
22-42
3
2
e(u, {2,3}}
= v(2,3)
- u
2
- u
= v(2,3)
3
= m1(u)
Therefore, we must have m (u') 1
u'
-
= e(u' ,{2,3}),
- u'
2
3
= m 2 (u).
and m (u') 2
This implies, by
definition, that u' is also in the nucleolus, which contradicts uniqueness of the nucleolus solution proven in part (b). •
(d)
= v(l,2) = v(l,3)
Agent 1 being a dummy means that v(I) - v(2,3)
= 0.
We have two cases to consider: (i) m (u) = e(u, {2,3}) at the nucleolus . 1 solution, and
m (u) -. e(u, {2,3}) at the nucleolus solution.
(ii)
1
Case (i}: m (u) 1
= e(u,
{2,3}) at the nucleolus solution. Using the result
of part (a), we must then have e(u, {1,2})
=-
=-
u - u = e(u, {1,3}) I
2
Using the fact that u + u I
2
+ u
3
1
3
= v(I), we can express u
u = u = [v(I) - u 1/2 2
u - u , which implies that u
3
1
0 as long as u
?:
1
and u
2 :!:
= u3 .
2
through u:
3
I
•
v(I).
Substituting these expressions into the formula for excesses, we obtain m (u) = e(u, {2,3}) = v(I) - u 1
- u
2
= u
3
I
?:
0,
•
e(u, {1,2}) = e(u, {1,3}) = - u - u I
= - [v(I)
2
where the inequalities hold as long as u
i?!:
1
u 1/2 < 0
+
1
~
m (u), 1
Now, if we had u > 0,
0.
1
•
we could define u' = (0, vCilj2, v(Ilj2). At this new point, we have
m (u') = 1
e(u', {2,3})) = 0
< u = m (u), I
1
•
which contradicts u being the nucleolus solution. case (ii): m (u) 1
'It
e(u, {2,3}) at the nucleolus solution. For
definiteness, suppose that m (u) = e(u, {1,3}) 3}). 1
(a), we must then have e(u, {2,3}) = v(Il - u At the same time, we know that u
1
equations, we can express u and u 2
u
2
= v(I) + u · u 1'
3
+
3
u
+ u
2
2
3
- u
Using the result of part
= e(u,
3
= v(I).
through u : 1
= -2u . 1
22-43
•
{1,2}} = - u - u .
Using these two
1
2
•
We see that we can have u
= (u 1•
u • u ) 2
3
~
0 only if u
1
= 0.
•
(e)
First, let us ·make sure that there exists an exactly feasible
utility point which euqalizes the three excesses. This point should satisfy •
the following conditions: v(l,2) - u
u
u
+
1
2
Let
• u
2
1
2
+ u
u , u • u 1
- u ·= v(l,3) - u - u
3
3
it
1
3
= v(2 , 3) - u 2 - u 3 ,
= v(I), 0.
denote the solution to the linear equations above.
Solving for
• u •
we
-
obtain: •
• u
= 1/3 [v(I) - 2v(2,3) + v(l,2) + v(l,3)],
• u
= 1/3 [v(I) - 2v(l,3)
+
v(l,2) + v(2,3)],
• u
= 1/3 {v(l) - 2v(l,2)
+
v(l,3) + v(2,3)].
1
2
3
Using the assumption that v(S) ~ v(l)/2 for any coalition S of two agents, it •
is easy to see that all components of
• ui
• u
are nonnegative. For example,
= 1/3 [v(I) - 2v(2,3) + v(l,2) + v(1,3)] ~ ~ 1/3 [v(I) - 2v(2,3) + vCil/2 + v(l)/21
=
= 2/3 [v(I) - v(2,3)) ~ 0 .
Substituting
• u
• u
into the formula for excesses, we obtain that each excess at
is equal to 1/3 [
L v(S)
- 2v(I)).
Therefore,
IS I =2
m
• (u )
1
= 1/3 [
L v(S)
- 2v(I)).
IS I =2 •
In further analysis, we will use the following formula, which is easily derived from the definition of the three excesses: m (u) + m (u) + m (u) 1
2
3
=
L v(S)
(4)
- 2v(l),
IS I =2
where m (u) stands for the smallest excess at the utility point u. 3
•
•
22-44
•
•
Now, suppose in negation• that the nucleolus solution u is different from •
• u.
•
1.e. it does not equalize the three excesses. Using the result of part
(a),
we must then have m (u} > m (u) = m (u). 1
m (u) 1
2
2
3
3
I:2 v(S)
> m (u) = m (u) = [
Using (4), this implies that
- 2v(I))/2 - m (u)j2. 1
IS I=
Using this inequality and the expression for
• m (u ) 1
obtained above, we see • •
•
that •
m (u) 1
>
1/3 [ L v{S)
- 2v(l))
IS1=2
= m
1
•
• (u ),
which contradicts the assumption that u is the nucleolus solution.
(f)
The characteristic function described satisfies v(S)
v(Il/2 = 3 for all
i'!::
two-agent coalitions S. By the result of part (e), this. implies that the •
equalizes the three excesses, and it is given
nucleolus solution of this
• u
by the point
• u
=
l
computed above.
• 4/3. u 2
=
• u 3
Substituting the numbers, we obtain
= 7/3.
To compute the Shapley value, observe that the three agents can enter a room in six different orderings.
For example, let us focus on agent 1. There are
two orderings in which he comes first, and in those orderings he contributes • •
v(l) - 0 = 0.
There are two orderings in which he comes last, in which case
•
he contributes v(I) - v(2,3) = 1. There are two orderings in which he comes second.
When he comes after agent 2, he contributes v(l,2) - v(2) = 4.
When he comes after agent 3, he contributes v(l,J) - v(3) = 4.
Weighting
each ordering with the probability one-sixth, we obtain the Shapley value of agent 1
as
his average contribution over orderings:
us = (2/6). 0 + {2/61 ·1 + 0/6). 4 + Cl/6). 4 = 5/3. 1
In the same manner, we can compute the Shapley values of the two other agents, which are us = us = 13/6. 2
3
22-45
Comparing to the nucleolus solution, we see that the Shapley value is more equitable: u
s 1
= 5/3 > u
•
= 4/3, which means that agent 1, whose
1
contributions are smaller than those of agents 2 and 3, is punished less in the Shapley value than he is in the nucleolus.
(g)
By definition of the core, an exactly feasible utility profile u is in
-
•
the core if and only if u + u
2
1
u u
1
2
u
+
3
+ u
3
•
i'!::
v(l,2),
i'!::
v(l,3),
i'!::
v(2,3).
(5)
If the core is non-empty, we can add up those inequalities to obtain 2v( I)
[ v(S).
i'!::
•
(6)
•
lSI =2
Suppose in negation that u, the nucleolus solution, is not in the core, i.e. at least one of the inequalities (5) is not satisfied.
For definiteness,
•
suppose that u + u < v(1,2). 1
2
m (u)
i'!::
1
•
This implies that
•
e(u,{l,2}) = v(l,2) - u + u 1
2
We are now going to construct an exactly feasible
> 0. utility profile u·' such
that m {u' ) :s 0 < m (u), which will contradict the assumption that u is the I
1
nucleolus solution .
•
First, let us see if the point
• u
which equalizes the
•
three excesses is fit for this role. (e).
This point has been computed in part
We only need to check under what conditions the point gives non-negative
utility levels to all agents. Using the expressions for
• u
from part (e) and
the inequality (6), we see that
• u 1
= 1{3 [v(I) +
[ v(S) - 3v(2,3))
i'!::
IS I :2
= 1/2
L v(S)
1/3 [3/2
[ v(S) - 3v(2,3)) = IS I : 2
- v(2,3).
IS I =2
Similarly, we obtain that
•
22-46
• u
i'!::
z
I:
1/2_
v(S) -
vU~3),
v(S) -
vU~2).
lSI =2
• u
i'!::
3
I:
1/2
IS I =2
I:
Now, as long as v(T) :s 1/2
v(S) for every two-agent coalition T, the
IS I =2
utility profile obtain m m
• u •
• (u ),
we can use (4):
1
• (u )
= 1/3
1
which equalizes the three excesses, is non-negative.
• (m (u ) 1
by the inequality (6).
+ m
To
•
2
• (u )
+ m
Therefore, m
1
3
• (u·))
I:
=1/3 [
v(S) - 2v(1)] :s 0
IS 1=2
• (u )
:s
0
< m 1(u), which contradicts
the assumption that u is the nucleolus solution.
I:
We are left to consider the case where v(T) > 1/2
v(S) for some
IS I =2 •
two-agent coalition T.
I:
Suppose for definiteness that v(1 1 2) > 1/2
v(S).
IS I =2 •
•
Let us now find the exactly feasible utility profile u' such that e(u' 1
u;
= 0 and
{1,3}) = e(u', {2,3}). Solving a system of two linear equations with two
unknowns (u'. u' ), we obtain 1
u~
u;
2
= lf2 [v(I) + v(1,3) - v(2,3)], •
= 1/2 [v(I) + v(213) - v(ll3)].
Now we can compute the three excesses at u'. We obtain: e(u' ,{1,3}) = e(u' 1{213})
= lj2· [
L v(S)
- v(l,2) - v(I)] <
IS I =2
L v(S)
< 1/2 [1/2
- v(I)] :s 0
IS I =2
(we have used the assumption that v(l,2) > 1/2
L v(S),
and the inequality
IS I =2
(6)). Also, e(u ,{1,2}) = v(l,2) - v(l) :s 0.
Putting the above inequalities
1
•
together, we see that m (u') = Max e(u' 1
1
S) :s 0 < m (u), which contradicts 1
ISI=2
the assumption that u is the nucleolus solution.
22.F.6.
(a) The first-best price equals to marginal cost: • •
•
•
22-47
• p
=
• c'(q ) .
But since c( ·) is concave, average cost
• c'(q ).
marginal cost:
• • c(q )/q
>
•
Therefore, the firm's profits at the first-best price are negative:
• • p q
-
• • c(q ) = [c'{q )
-
• • • c(q )lq J q
< 0.
•
(See Figure 22.F.6(a) for an illustration. The average cost (AC) at a point on •
the cost curve is the slope of the line connecting the point with the origin. The marginal cost (MC) at this point is the slope of the tangent to the curve at this point.
The average cost always exceeds the marginal cost for a convex
cost cn!'ve.) •
•
22.F. On the other hand, If costs are covered and p have S' (q
0
)
=p
0
> c'(q
0
),
0
0
0
• c(q )/q , then we
which implies that production is socially
suboptimal. (See Figure 22.F.6(b)). •
S'(
I I
AC
MC
q
Fi 22-48
·
(b) The second-best welfare problem can be written as max S(q) - c(q)
s. t. S'(q)q
?:
c(q).
If the constraint were not binding, we would obtain the first-best solution, •
but from part (a) we know that then the costs would not be covered contradiction. Therefore, the • constraint Is binding, and the second-best quantity is given by S'(q)q = c(q), i.e. price equals average cost .
•
(c) We can interpret every unit of output as a "project", with c(q) describing •
how much it costs to run q projects at once. The Pareto property of the Shapley value in this context means that the costs have to be fully covered, while the symmetry property implies that the price for every "project" should • be the same. Thus, the Shapley value suggests that every unit of output should be priced at the average cost.
22.F.7.
(a) The second-best problem can be written as S (q ) + S Cq ) - c(q ) - c(q )
max
q 1 ,q2
1
2
1
s.t. S'(q ) q 11
2
1
+ S'(q ) q
I
22
2
•
2
- c(q ) - c(q ) 1
2
?:
0.
If we. denote the Lagrange rimltiplier with the constraint by >.,
•
the first-order conditions obtained by differentiation can be written as (1+>.) S'(q) - (l+A.) c'(q) + >.S'(q) q 1
I
1
1
I
I
= 0,
= 1,2.
i
S"( q ) q
If we denote the elasticities of demand by
£
I
(q) = I
-
1
I
1
the first-order conditions can be rewritten in the form •
(S:(q
) 1
c'(q ))/S;(q 1
) 1
=
a.fc 1(q1)
for some
Thie coincides with the Ramsey taxation formula (22.8.1 ). •
22-49
a. > 0.
•
•
(b) By symmetry of the problem, the Shapley value cost allocation should •
allocate the same value (c ) to all projects of type 1, and the same value • 1
•
(c ) 2
to all projects
of type 2. Take a unit project of type 1, and take a
random ordering of the large number of small unit projects. Suppose that the proportion t of all the projects precede the given project. Since by the Law of
I
.arge Numbers with a very high probability our project will be preceded by
an almost perfect sample of all projects, therefore the output of all preceding projects will be (tq
, 1
tq/ The contribution of our project to the
costs will therefore be c' (tq ). Since every t is equally likely, the Shapley 1
value for type 1 projects is obtained by averaging: 1
1
1
c' (tq ) d(tq ) = c(q ljq .
c' (tq ) dt = Cljq )
c =
•
1
0
I
1
0
1
l
I
Similarly, the Shapley value for type 2 projects is
•
c2 = c(q1)/ql.
(For a rigorous derivation of Shapley value with a continuum of agents, see
R. Aumann, "Value of Markets with a Continuum of Traders", Econometrica 1975, 43, pp .. 611-646)
(c) If outputs are priced according to their Shapley values obtained in part (b), this results in average cost pricing for each output. •
production levels
(q , q 1.
2
The resulting
) will be determined by the intersection of demand
curves and average cost curves:
Clearly, production is lower than the first-best levels, as long as costs are strictlty concave and average costs exceed marginal costs. In general, this is also different from the second-best allocation obtained in part (a).
Indeed,
under average cost pricing, production level for each output is entirely determined by demand and cost functions for this output, and there is no
•
22-50
•
cross-subsidization.
In
contr~st,
under Ramsey pricing in obtained in (a),
production level for each output is in general determined by demand elasticities for both outputs (which enter from the break-even condition defining «}, and in general we should expectcross-subsidization. For example, if demand for good 1 is perfectly inelastic, under the Ranasey pricing good 2 is priced at marginal cost and subsidized from the non-distortionary mark-up on good 1.
22-51
23
23.1.1.
In (a) and (d) agent 2 is indifferent between truth telling
or·lying, and therefore is willing to tell the truth. In (b) and (c) agent 2 strictly prefers truth telling. However, in (e) the agent.always 0
•
prefers to lie because
23.1.2.
z~ (8')y,
2
Agent 2's problem is:
which is equivalent to:
and
y~ (8')z.
2
·
max
...
2
' 2-
max A
•
Taking the FOC (note that the SOC is satisfied) we get
This result
•
is similar to the understatement in the first-price auction in example 23.b.4. (see footnote 6). •
23. B. 3.
Showing this is basically following the argument at the end of
example 23.B.4.
Agent i can choose bi(8i)-aili where aie[O,l]. Assume all •
Agent i is then indifferent between a e 1 .
, 1 ] 'i
(lower values of a.L will give him zero utility).
If there exists j s.t.
ajlj>8i then agent i is indifferent between a e[O,l]. 1
weakly dominant strategy .
•
23 - 1
Therefore, a.-1 is a L
23.B.4.
(a). Normalize the seller's (agent 1) and buyer's (agent 2)
no-trade utility levels to zero.
The parties'
payoffs as a function of •
•
' 2-
To find a Bayesian equilibrium with
•
first note that a seller of type 1 •
1
will bid b
to maximize•
1
his expected payoff:
max
bl+a2+J32 1 2
Eu1 -
2
-
1
· 11
I
a2+J32I2>bl
(bl-Q2)/J32
the FOC yields (the SOC is satisfied): •
(i) •
Similarly, the buyer maximizes her expected payoff:
(b2 -Ql) /,61 8 2
0
the FOC yields (the SOC is satisfied):
•
(ii)
The two equations (i) and (ii) above yield: a Trade occurs if and only if
1
1
2
--3
--4
.
b (1 )
strategies, trade occurs if and only if
1
+
1
4
<
s2
. The transfer in case
of trade is function is not Pareto optimal because
9 < 9 does not guarantee trade, and 2 1
efficient trade may not always occur .
• • •
23 - 2
(b) The social choice rule above has
and •
•
•
Ve will check if it is
truthfully
impleme~table
in a
direct revelation mechanism,
that truth-telling is a Bayesian Nash equil
i.e.,
in the direct •
•
mechanism.
The seller,
assuming that the buyer reveals herself •
truthfully, solves:
... ...
•
the FOC yields (the SOC is satisfied):
-
1 -4
1
-
- -6 - ' 1
- 0
... which implies that 1 -1 . 1
1
Similarly, the buyer solves: •
A
A
1
max
- -]dl 6 1
A
•
0
the FOC yields (the SOC is satisfied): 1
'2 -
-6 -
1 ... 1 -(1 - -) - 0 3 2 4
•
A
which implies t:hat 9 -8 . 2 2
23.C.l.
Therefore truth telling is an equilibrium.
Assume the preference reversal property is satisfied for all i,
'i·
9j:0 and 9 _ , and assume in negation that f( ·) is not truthfully implementable 1 in dominant strategies.
That is, there exists i,
'i· 'i·
and '-i' such that
but this contradicts the preference reversal property, therefore, f( ·) must ·be truthfully implementable in dominant strategies.
23 - 3
2
23.C.2.
for which x 1>x 2 , 'i' The majority voting social choice •
•
function is defined by {let x
be chosen as a tie-breaker):
1
f(l)•
•
It is easy to see that if agents are asked to vote one way or another (i.e., •
a "direct mechanism") then no agent has an incentive to lie no matter what his preferences, or the other agent's announcements are. In cases where an agent is pivotal then he will strictly prefer to tell the truth (telling the truth will cause his preferred outcome to be chosen while lying will •
cause the other outcome to be chosen). he is indifferent.
In all other cases (no influence) then
Therefore, £(·) is implementable in dominant strategies . •
23.C.3.
Let
~.-'P 1
for all i, £(·) be ex post efficient, and assume in
negation that there exists all i, then there exists and for all i.
iex
-1-(1-
1
such that for all le8, f(l)~i.
, ... ,1
1
)ee_
such that
Since ~ -'P for
1
for all xex,
This, however, contradicts£(·) being ex post efficient,
therefore f(8)-X . •
23.C.4.
Assume that f:8 -+ X is truthfully implementable in dominant
strategies when the set of possible types is {by definition) that for all i and for
al~
e1 for i-l, ... I.
This implies
s1eei,ui(f(li,l-i),li) >
u 1 (f(li·'-i),l 1 ) for all 9{E8i and all B_iee·i·
This implies that for all i,
A
all l_iee·i' which in turn implies the desired result.
23.C.S.
Define
F( ·)
to be the pairwise majority voting social welfare
23 - 4
functional (note that single-peaked domain ensures that this functional is rational).
Observe
that
_satisfies
F( ·)
non-negative
responsiveness.
0 0
Therefore, if we define f(·) to be the'social choice •
tion that selects a
Condorcet winner, i.e., the maximizer ofF(·), we can apply Exercise 23.C.7 below to see that f(•) is truthfully
le in dominant strategies. •
• 0
23.C.6. and
(a)
Let X-{x,y) and let there be two type profiles 1'-(li•····li)
IN-(Ii·····li)
where all agents are indifferent between x andy no
which type profile occurs.
Let f(l' )-x: and f(lw)-y.
example for f(·) satisfying IPM and not being monotonic.
tter
This is a trivial •
•
•
preferences are:
••
•
•
z
w
X
X
y
X
X
y
w
z
y w z
y w z
0
and
The
only
two
preference changes for which the "if" part of the monotonicity definition is satisfied •
are the change from (li,12) to (1i,l2)• and from (1i,12) to
(li,li>·
Indeed,
the "then" part of the definition is also satisfied for these two changes. For all other preference changes, the "if" part of the definition is not •
satisfied, therefore the definition is vacuously satisfied. f(·) is monotonic.
Now observe that
conclude that
f(91,92) E L (f(Bi,82),1i>· 1
IPM is not satisfied. (c)
~e
Therefore, •
From Proposition 23.C.2 we know that£(·) satisfies IPM if and only if •
it is truthfully implementable in dominant strategies.
Now consider two
• 0
profiles of types, 9 and 6', such that
Li(f(l),li) C Li{f(6),8i) for all i •
23 - 5
•
e~ist
(if no such two profiles
in
•
e
then f(·) is vacuously monotonic).
We
•
•
need to show that £(8')-f(l), and this can be done by following the proof of •
1 in the proof of Proposition 23.C.3.
Claim (d)
Suppose in negation that f(·) does not satisfy IPK, i.e., there exists
'i·'f.· and '-i such that
•
that
f(l)~f(li·'-i)
Since ~i-7' i this implies
.f(l)llLi(f(lf.·'-iLif.). •
and that
•
•
•
•
ui(f(l),lf.) > ui(f(lf.,l_i),lf.>· Consider the strict preference
'i
such that f(l) is at the top, f(lf.·'-i) is •
second, and all other alternatives are below these two in some arbitrary order.
This construction implies that Li(f(l),li) c Li(£(1),11), therefore •
monotonicity
implies
that
f(8i·'-i)-f(l).
Note,
however,
that
this
construction also implies that Li(f(lf.·'-i),lf.) c Li(f(lf.·'-i),li), therefore monotonicity implies that
f(81,1. 1)-f(8f.·'-i)' a contradiction .
•
•
23.C.7. is
single-valued.
responsiveness,
'We want to show that if
F( ·)
satisfies non-negative
then f( ·) is implementable in dominant strategies. By the
Revelation Principle, it suffices to check the direct revelation mechanism, i.e., to show that for all i: •
Suppose
in
negation
that
there
exists
an
agent
who
can
gain
by
A
misrepresenting, that is, there exists iei, 9-(8i,B-i)' and 8i, such that izes F( ·), and is single valued, so we have: f(B)•x
implies
x
Fp(~i(l ),~_
1
A
A
1
(8_
1
))
y
(i)
•
Now we apply non-negative responsiveness of F( ·) to (ii), by noticing that when we move from {li,8-i) to I, y can only rise relative to x for agent i's
23 - 6
preferences, and does not move for the other agents. y Fp (~i (6 i_) ·~·i (6 ·i))
which contradicts {i) above.
Thus we must have:
X
Therefore, no agent can gain by misrepresenting
his preferences.
23.C.8.
(a)
It is easy to check that we cannot improve upon f(·) for one •
•
•
agent without hurting the other, therefore f(·) is ex post efficient. It is again easy to check that given the preferences, E{·) satisfies the
(b)
property identified in Proposition 23.C.2. (c)
Truth·telling is not the unique (weakly) dominant strategy · another one •
is for each agent i to always announce 6 -61, which causes outcome a to be 1
implemented.
The agents are indifferent between this strategy and truth· •
telling because with preferences (6i,62) the agents are indifferent between a and b, and for all other preferences,
alterr~tive
a would have been
•
implemented anyway. •
\le begin by showing that if f( ·) is truthfully implementable in
23.C.9
dominant strategies then both conditions are satisfied.
Actually, the second
condition was shown to be satisfied in section 23. C,
and is exactly the
condition in equation (23.C.l3).
ak(6)
as i
~ ~
0·
Therefore, we only
Let 9-(8 , ... ,6 ) and take 6i_>6 . 1
1
1
optimal, we must have: •
(i) and (ii) imply: •
23 - 7
need to show that
Because truth-telling is always
(iii)
let 'i•1 +dli, which for 11 dli implies that (ignoring higher order 1 dk- Bk(l)·d9' and we can rewrite (iii) as ) 88
i'
i
av1 (k(l),lt) 8k(l) . . dl
av 1 (k(l),li) Bk(l)
it.
•
• dl i •
• •
which is equivalent to: Bk(l) ·--·dli a1i
-
~
(iv)
0
•
but since 11>1 , and we ass•wed that 1
•
•
brackets in (iv) is strictly positive. (recall
that dli>O) we must have
Therefore, for (iv) to be satisfied
8k(l) Bl i
~
0
co.
•
We •Fe lefc to show the converse, i.e., that both conditions imply that£(·) is truthfully implementable in dominant strategies.
As
in negation that •
there exists an agent i, such that given types 1-(li,l-i), agent i strictly prefers lying and announcing that he is of type. I i.
Define
agent i' s
A
•
utility, given types are (li,l-i) but he announces lias: A
•
A
•
A
Our negation ass A
'
'
•
•
au(81,r)
Bv(k(r,l_i),li) Bk(r,l_i)
-......;~-ddr-
----~__...;;;.._ •
ae(r,l_i) +
ak
ar
dr> 0
(v)
ar
'
' A
From the first condition, i.e., k(8) is increasing in •
' '
8i' we know that
8k(r,8 _ ) 1
~
0, and from the ass
23 - 8
tion
we know that: •
8v(k{r,6_i),r)
av(k(r,8_i),6i) for all
- - - - - - - l!::
ak
(vJ.)
Bk
•
using (v) and (vi) we get: A
6
•
Bv(k(r,l_i),r) 8k(r,6_ )
8e(r,6_ ) 1 + _ _ _..;;:..._ dr - 0 Br
1
-------·---·~__;;;;-
Br
Bk 6
•
because the bracketed tera equals zero for all
(see equation (23.C.l2)) •
...
This, however, contradicts our negation as
that u(li,Bi)-u(li,6i)>O
so£(·) must be truthfully implementable. A
~Suppose
(vi)
6i
•
We can proceed as before, however the inequality in
above will be reversed,
and we will have a
sign before the
integral, so we will get the same contradiction . •
23.C.l0
· At the end of the first paragraph insert:·
[
"Assume throughout that conditions are such that necessary
condition
for
{k*(·)
•
,el (·), ••• ,e(·)I)
implementable in dominant strategies."
holding is a
(23.C.8)
to
be
truthfully
Also, in the second line of part c)
•
insert the word "implementable" before
"ex post efficient social choice
function".] a) $uff1ciency: Suppose.that we can write V*(6) - LiVi(6_i).
Consider the
transfer functions of the form + h. (6 i) • 1.
-
where for all i, •
•
h {6 .) - -(I i ·L
for all 6 -i .
By proposition 23.C.4, {k*(·),e (·), ... ,e(·) ) is truthfully implementable in 1 1 23 - 9
dominant strategies.
Moreover, for all I we have,
•
•
j~i
i
i
- (I - l)V*(I) - (I - 1)L V (I i
i
-i
) - 0
• Suppose (k*(·),t 1 (·), ••. ,t(·)I) .is ex post efficient and is •
truthfully implementable in dominant strategies.
Since (23.C.8) is necessary •
(by as
tion)
for truthful
tion,
this means that there exist
I
functions (hi(8_ 1 )Ji-l such that (I- l)V*(I) +
r
hi(l-1)-
i
I .r
vj(k*(l),lj) j"'i
i
+
r i
hi(l 1) -
-I ei<s> - o i
•
But this implies that by defining •
L Vi(l_i)
we can then write V*(l) -
i
•
b)
·
If vi(k,6 1 ) - 1 1k-
1
2
k
2
for all i, then, k*(l) - Argmaxk(Lili)k-
r '
for all 6, and so the FOC implies
V*(l)
-
3
Ii'i
6 Ii i
-
ri
3
1 ri9i
. Hence, 2
6 1 l1 i
'i - 2
~3~
- (61+ 62+ 63)[61+ 62+ 83 1
~
2
2
2
- 2C.t.i 9 i)
2
- (81 + '2 + 83 + 29182 + 28183 + 28293) . •
We now define, Vl(l2,l3)-
,2 + ,2 2 3 2
6 21 + 2 3 '
,2 + ,2 3 1 9 28 V2(61,93) 2 + 1 3 ' 23 - 10
•
•
•
•
•
0
•
and the result then follows from part a) above since V*(l) - Vl(l2,l3) + V2(ll,l3) + V3(ll,l2) . 0
1
c)
then clearly
a V*CI> al ···al 1
I
- 0. •
BV* all 2 a v* as 1a1 2
avl
-
Bk + ak
2
ak avl a1 + Bl ' 1
1
2 a v2
2
a v2 + 2 2 ak ak
a vl
-
av2
2 _a vl
ak ak ak ak • • + a1 1 as 2 + BkBI 2 a1 1 akal as · 1 2
Since, •
we have, •
- -
,
•• •
which in turu implies that
- -
"' 0 •
thus proving the statement . •
23.C.ll and as
Let agent 1' s Bernoulli utility function be •
ui (vi (k,li) +
in negation that Proposition 23.C.4 no longer holds.
-m
+ t 1 1 That is,
A
there exists i, 1 , 1 1 , and l_i such that: 1 A
A
Substituting from (23.C.8) we get: A
A
• 0
Given ui(·) > 0 this implies that: I
,..
l
I
vj(k*(li,l-i)'lj) >
j-1
l
vj(k*(B),Ij)
j-1
a contradiction to k*(·) satisfying (23.C.7).
Thus, £(·) must be truthfully •
implementable in dominant strategies . •
23.D.l
(a) The set of alternatives X are all pairs (k,y) where
k-1,2, ... is the period in which trade occurs, and yeR is the transfer from the buyer to the seller (the price). (b)
•
s-o
It is clear that when 1-9, the seller will not want to announce that
since then he will receive a net payment of (-4)
ately.
The relevant
6k(9.5 - 0) ~ 5, i.e., that a
incentive constraint is therefore
will not misrepresent given that trade will occur after k periods. this yields the minimum k required: k
23.D.2 . (a)
l!::
s-o
type
Solving
[ln(l0/19)]/ln(cS).
Letting the seller be agent l, it is optimal to trade if and
only if 1 >8 , so we must have: 2 1
and of course, v (k)•8 1
(and zero otherwise).
0
if
8 s8 1 2
1
if
91>82
if k-0 (and zero otherwise) whereas v (k)•9 if k-1 1 2 2 From equations (23.0.8) and (23.D.9)we can derive the
transfer functions for each agent. - E
For the seller:
82
[
s2
23 - 12
- -E •
'1
[ '1
I s 1~s 2 1
2
1
-
'2 - 1
-I s1ds 1 -
2
'2
and since the optimal transfer for agent 1 is the sum of these two
we
have:
•
•
• •
, it is clear that:
By
•
(b)
We will show that for each agent 1,
truth-telling is optimal in
expectations given the belief that agent j"'i is always truth-telling. The problem for the seller is: •
Max
"
•
which reduces to: •
Max
(i)
.
which yields the FOC (the SOC is satisfied): 1
"
-e -o 1 1
• •
For the buyer, the problem is: •
Max ,.. A
which symmetrically gives us the FOC: 1 -1 2
23.D.3.
-o. 2
It is easily seen that the conditions for the Revenue Equivalence
Theorem are satisfied for the two auction settings.
We will now verify that
•
both examples 23. B. 5 and 23. B. 6 yield the same expected revenue to the •
seller.
In the sealed-bid first-price auction we have: •
•
1 1 11 -·Prob( 1 ~1 ) 2 1 2
0 0
1
1
-
1
't
ldl2dll 0
2
--
2
'
0
6
•
0
• •
•
for player 2 we get that E[-e (1)] - 1/6 as 2 Now consider the sealed-bid second-price auction:
Since the problem is well.
1 1
0 0
•
1 1
-
-6
0
•
0
tric for player 2 we get that E[-e (1)] - 1/6 as 2
Since the problem is s well.
0
Therefore, both the first and second price auctions yield an expected
revenue of 1/3 for the seller {for a general fotmula with any I and with valuations in [0,1] see exercise 23.D.6).
23.D.4.
(a)
'i
Let
<
'1·
let b' and b• be agenc i's bids associated in negation that
with his two types, and as
b' >b-.
Denote by
K'
bids
and
and
•
the
probabilities
respectively. that
(I'
i
i
'
• •
and similarly,
~
winning
the
auction
given
lity (using a revealed-preference ar
By op
- b' )'If'
of
(I'
i
- b"')K"'
i
which implies:
K' I' - b"' i i (i) I' - b' 'If"' i i i!:. (I"' - b' ) 'If' which implies: (I"'i - b"')'lf"' i i i •
23 - 14
b' i
b"'
t) we have
i
«'
I" - b"' i i
(11)
I"' - b' i
i
•
(i) and (ii) imply (after some simple algebra) that •
li>Cbi - bi> ~
o
that I"' - I' > 0 and b" - b' < 0 i i i . i
which is a contradiction to our in negation that there is a s
(b)
<11 -
tric equilibri
,1~).
with (I' •
such that b*(l)-b for all le(l' ,1"').
Let «>0 denote the (strictly positive) •
probability that all agents' types are in this interval (it this
case
all
agents
get
the
good with equal
t be that in
probability because
the
• •
equil
is
).
Let pi(l ) be the probability that agent i gets 1
the good if" he bids b*(l i). deviates and bids
-b +
t
> b.
Now as For
that for all eie(l' ,1"') agent i , the loss is pi(li)·t, while the
t •
gain is that he will get the good with probability 1 in the event that all types are in (I' ,1"'), and will increase the probability of getting the good in all other events. Ignoring the second gain, the total change is then at least: •
•
So for small enough
t
this deviation is beneficial.
Therefore, we must have
b*(li) strictly increasing. (c)
'We need to verify that the conditions for the Revenue Equivalence
Theorem are satisfied. positive density.
First, all valuations are drawn from an interval with
Second, for the lowest valuation each agent gets the good
with probability zero so the expected utility is zero. Finally, since b*(l ) 1 •
is strictly .increasing,
then the highest valuation agent gets the good with
probability one and all others get nothing.
These conditions are equivalent
to those that would be satisfied for a sealed-bid second-price auction, and therefore the Revenue Equivalence Theorem holds. •
23 - 15
•
23.D.5.
'1
Let
<
'i•
let bi and bi be agent i's bids associated •
with his two types, and assume in negation that the
tr"'
probabilities
respectively.
'
of
winning
b' > b"'
Note that
the
bl > bt.
auction
implies that
a revealed-preference argument) we have that
•
•'
given ~
Denote by
1r'
bids
and
b' i
and b"' i
•"'· By optimality (using ~
6'1f' - b' i i
I
i 1r"'
-
bt which
•
implies:
b"' i
Similarly,
6"'1r" -
i
b"' ~ i
6'(1r"'- •')
-·b'~
i
(i)
i
'iff' - bi
which implies:
'i(1f"'- tr') ~- bi- bi
(i) and (ii) imply that
('Ill -
', )( ,.....
i
i
have a contradiction to our this holds with
-
(ii)
ff' )
ion chat 9"' i
ity this implies that
If this is strict, we
0.
'i
> 0 and
1r" -
~
1r'
0.
If
bi - bt - 0, a contradiction to •
our as
bt - bi > 0.
ion that
Now to show that the bid must be strictly increasing in the type's valuation, an almost identical argument to that in part (b) of exercise 23.D.4 can be •
used (see above).
Therefore, the argument of part (c) of exercise 23.D.4
applies here as well and this concludes the answer . •
23.D.6.
Going to stand in line t hours before 9:00am is equivalent to •
•
biding a monetary amount of Pt dollars (ignoring the cost of the ticket which is assumed to be captured in 6).
Since this is equivalent to a sealed-
bid first-price auction, we know from the Revenue Equivalence Theorem that the expected revenue from the auction (i.e., the expected highest bid) is equal to that of a sealed-bid second-price auction.
Therefore, we need to
•
calculate
the
expected
straightforward to see valuation
is
second-highest valuation of that
I· (I-1) ·F(t)
the
agents.
It
is
the density function of the second highest
I-2
second highest-valuation is:
·f(t) • (1-F(t) J, •
•
23 - 16
and
therefore
the
expected
1 •
t·t
E[b] - I(I·l) •
1-2
·l·(l·t) _dt- I(I·l)
t
•
I+l
I+l
•
0
indivi~sa1
E[t] •
Therefore,
if fJ doubles,
I-1
-
I+l
0 t-b/~,
Given a monetary bid •of b, the respective waiting time is expected waiting time of the first
1
so that the
is:
I·l JJ(I+1)
•
the waiting time goes down by 50',
and if I
doubles, the waiting time goes up but this increase diminishes to zero as I goes to infinity. •
From the solution to Exercise 23.0.2, we know that the seller will
23 .E.l.
•
tell the truth,
and his expected utility will be given by the function
(this is (i) from the solution to 23.0.2, and
taking 1 -1 ): 1 1
1 1
•
•
+-
1 +-
2
6
0
•
,2 Therefore, the seller will gain from not participating if is, if
, 1" > 1 -
2/3
•
1
-1+, that '>1 2 6
Note that since the buyer's reservation utility is
0, he will always be better off participating under the assumption that the seller is always participating.
23.E.2
(a)
The Myerson-Satterthwaite Theorem
tells us that there is no
•
Bayesian incentive compatible (BIC)
and interim individually rational (IIR)
social choice function (SCF). We know that if a SCF is incentive compatible (DSIC), then it is BIC.
dominant strategy
Therefore, a SCF which is not
BIC, is not OSIC. This concludes that there is no SCF that is OSIC and IIR. •
•
23 - 17
•
We know that if a SCF is ex post individually rational, then it is IIR . •
(b)
•
•
Therefore, a SCF which is not IIR is not ex post individually rational. This, •
with the Myerson-Satterthwaite Theorem concludes that there is no SCF which is BIC and ex post individually rational . •
23.E.3 •
•
implies that k(l,l )-k(3,4)•1 and k(3,2)-o (where k-1 denotes trade and k-0
2
no trade).
we
efficiency.
Now set
Now for individual rationality we must have the following:
t (1,2)
1
tl(l,62)
1
t2(11,2)
tl(3,62)
3
t2(81,4)
-
t (1,4)
1
-
2,
t
1
(3,2)
trically set
-
0,
-2 ~
-4
and
This example gives ns
the
required result, which concludes that without a strictly positive density function (i.e., with discrete values) the Myerson-Satterthwaite Theorem may •
not hold.
23.E.4 .
Since both agents are risk neutral, we can interpret this
•
game in the following way: If trade occurs at date t, this is equivalent to t-1 trade· occurring with probability 6 due to the discounting.
Then, trade
occurring in the first period is equivalent, in the interpretation model, to trade occurring with probability one.
But the Myerson-Satterthwaite theorem
exactly tells us that in this setting we cannot have trade ocuuring with •
probability one.
23.E.S.
(a)
•
The expost efficient trading rule will have all the highest
valuation agents owning a unit of the.good.
i.e., we may have only buyers,
only sellers or a mixture of both ending up with the good, as long as there
23 - 18
~ I*
is soae I* such that all agents with I others do not.
The total
have one unit of the good and all
of good is given by the cont
(b)
Define the following "competitive" social choice function as follows:
Let q
and q denote market supply and demand, and be defined as: 0 8
qD -
.
- - !2 '2 -,2 - p
for p ~ !2 for
for p
0
The market equilibr the efficient
!2
0
for p ~ !1 for !1 s p s 0
~ p
2:::
qs -
s j2
-'2
p -
!1 -' !1 1
for p ~
-'1
;
1
.
price p* will cause efficient trade, and will lead to
outcome
described in
(a)
above.
There will
be no
need
for announcements, so that is is incentive compatible (vacuously) and it is individually rational since a b':lyer will buy if and only if p:SI , and a 2 seller will sell if and only if
~e
1
.
This example concludes that for a
continuum of buyers and sellers the Myerson- Satterthwaite Theorem no longer holds.
23.!.6.
• •
(a)
The efficient trading rule is such that if
sell the good to i for a price (b)
1
and b
then j should
pe[9i,8j).
Let bi denote agent i's bid.
the relative values of b
li~lj
2
The utilities of the agents, conditional on are: bl2::b2
Restricting the bids to linear bids, biexpected utility:
•
23 - 19
Q
+ /Ji I i, agent 1 maximizes his 1
•
1
0
Using Leibnicz's rule we obtain the FOC: •
• •
1
Odl2 - 0 0
which yields (after some simple algebra):
(i)
•
(ii)
3 •
(i) and (ii) imply that a
1
a
-o 2
and therefore bi-
s1
for i-1,2 .
•
(c)
The social choice function that is implemented is: 8i>Bj implies that i
buys the good from j at price
e1 .
Bayesian incentive compatible, individually rational.
The analysis in (b) above shows that it is and it is clearly ex post
The result differs
efficient and
from the Myerson-Satterthwaite
Theorem because of the symmetry of the agents - each agent is a buyer and a seller so there is always an efficient trade . •
23.E.7
(a) •
•
•
Let y(B ,e ) be the probability of trade and t(8 ,e ) be the 1 2 1 2 •
payment from the buyer to the seller given that they announced (B 23 - 20
,e ). 1 2
ex
pose efficiency entails that y(B 1 ,B )-1 if 1 <1 , and y(B ,s )-o otherwise . 2 1 2 1 2 •
Denote the expected payment that the announces
'1
~eller
anticipates to get given that he
by:
For incentive compatability on behalf of the seller we must have that truth •
telling solves :
s ·Prob(li>l ) 2 ,, 1
Max
•
+
-t (B' ) 1 1
1
Given that y(B ,1 ) is ex pose efficient, the objective function is just
1
2
11-9 1
to be a solution we must have the following FOC:
dt 1 (Bl)
for all
e1
•
Integrating this we get: 1
1
•
Note that from interim IR, we must have
t 1 (l)t!:O, otherwise the seller can •
the good, getting a utility of 1. Using this, the integral
leave and -
above yields: e <1 )
1
1
~
1
1 2
2- 2' 1 .
Therefore, the interim expected utility of
the seller, given that truth telling is optimal (IC), is given by: 2
Similarly, denote the expected payment that the buyer anticipates to pay given that he announces
92
by:
-e2(B2> •
For incentive compatability on behalf of the seller we must have that truth telling solves :
•
•
Max 9' 2
•
Given that y(l , 8 ) is ex post efficient, the objective function is just 1 2
23 - 21
Note that from interim IR, we must have
-t
2
(0):SO, otherwise the buyer can
leave and get a utility of 0. Integrating the FOC from 0 to 1 , and using this 2 1 2 interim IR condition yields: t 2 <1 2 ) ~ 2' 2 · Therefore, the interim expected •
utility of the buyer, given that truth telling is opt
1 (IC), is given
by:
Adding the interim expected utilities, we get that the ex ante sum of expected utilities is: 5
--6
:!!:!+ 2
•
0
Remark:
The result above can be
derived using inequality
(23.E.4).
The
minimum total expected utility for the two agents should be the expected utility of the seller wit:hout: trade, plus the minimum •
expected
gains
from
trade.
The
latter
can
be
calculated
by
rearranging (23.E.4) as follows: 1 1
•
•
•
0 0
0 0 •
The right hand side of this inequality is the expected gains from trade, and solving the left hand side with our parameters gives
1
3· 1
Adding the seller's expected utility without trade, which is 2' •
gJ.ves us
5
6
as calculated above . •
23 - 22
(b)
If the ·true observations are (1 ,1 ), the total utility that can be 1 2 • •
produced is at· most overcome.
Kax(l
, 1 ), even if all info 1 2
ional
ies are
Thus, the ex anee total expected surplus can be at most: •
1 2
--3 0 •
Therefore, no SCF can have the
23.F.l
of expected utilities exceeding
2
. 3
We prove the statement in three steps: ~
•
If E( ·) -
(k( ·), t ( ·), .•. , ti( •)) is ex post classically efficient 1
then it is ex-ante classically efficient. j'roof: Suppose not, A
i.e. , there exists a feasible social choice function
A
A
(SCF) E(·) - (k(·),t (·), ..• ,ti(•)) such that , 1 A
(i) •
with strict inequality for at least one i.
This implies that
•
A
A
E1 [L 1 t 1 (1)) - E1 [Liti(l)] ~ E1 [vi(k(l),li)] - E1 [vi(k{l),8i)].
(ii)
From ex post efficiency of £( ·) we must have that the right hand side of (ii) A
is non-negative, and that E [Liti(l)] - 0. 1
However,
feasibility of £( ·)
A
implies that E [Liti(9)] ~ 0, a contradiction. 1 Claim 2: If£(·) - (k(·),t (·). ... ,ti(·)) is ex ante classically efficient 1 and £( ·)
·E
F* then it is ex-ante incentive efficient.
Proof: By definition {see Definition 23.F.l and the preceding paragraph). 3; If £( ·) - {k( ·), t ( ·), ... , t ( ·)) is ex ante incentive efficient 1 1 then it is interim incentive efficient. Proof: his is just restating Proposition 23.F.l. •
•
23 - 23
2.3.P.2
think of the buyer as
th9 a&ent,
principal, in the seetlng of example 2l.F.l. u (1,•,t) - lv(x) • 1
and a higher con
t
and the aonopolist as tbe
The agent's utility is glven by
(so that a higher I results in a higher utillty level ucility
~a~ginal
-
latter
the
The sellers utility is given by
is
•etngle crossing•
the
u (B,x,t:)- t - e•x. 0
the revelation principal we can concentrate on a direct
mecbants~
Using
(x(f),t(l))
which solves the sellers proble•: Max x(l) .t(B)
c·~(l))
E[c(l) •
(X(f),t(l)) is Bayeaian ve eompatibh and indivf.dually rational.
s.t.
We now follow the analysis of linear utility 1n section 23.D [with k-x, and v(l)•v(x(l))).
u1 (1)-
Lcttin&
fv(x(l}) • t(l) denote the utility of type
from tluth-telling, proposition 23.0.2 implies that the principal's
I
problem h
equivalent to (recall that
V' ( • )>0
so that conatToi.nt (i) ean be
•
11fr1 tten a• •hown below):
Kex
•
E{lv(x(B)) - U(B) • cx(6)J
x(l) ,U(I) s.t.
(i) X(·) is non-dacrea£1ng
(11) U(l) • U{B)
j
•
(iii)U(S)
~
' + f ,•
•
for all Be(e• ,IJ
v(x(s}}ds
for all te(e,i)
0
-·
Following the same steps as in example 23.F.l the problem
beco~es:
-
' Max
rev(x(l))
·
cx(l)]~(8)dl
- U(l)
-
x(ll') ,U(e)
' •
s.t.
(i) x(·) is non-deereas1ng (ii) U(l)
-
~
0
2J • 24
'Clurly~ruu w111 blnd -.c a solution. and wt:ing integradon by pares the •
proble• becoaes: •
,.- .
·~':
... .
-I
l'i.;
••
.
.
••
.'
• • "
••••
Kax
v
.
v(x(B))
- c.x(f) #(l)dl
x(l)
'•
x(•) is non-decreasing
s.t.
Isnortng the eonatra1nt. and ass.,qtn.g an lnt:erlor solution (see in chapter 23)
w•
footno~:e
22
•
get that the function x(l) which solves the problem
~st
satisfy the FOC:
' .
1 · ~(I)
• c • 0
~(9)
for all fE(I,I] -
To see that the solution x(·) 1s indeed non-decreasing, the same argument as ln example 23.F.l applbs hen as well.
Note that the hi&hesc: •
ve get
val~tion
'Itle soc is sac1sf1ed since v•(·)
consumer h set at the
f1rst·b~st
level since
•
v' (x(B) )I - c - 0, but all other eonsUJHr types are distorted (this
•
v1ll
We
23.F.3.
follow
the
an~lysls
particular the result of equation (23.F.9).
!-o,
there edsts I such th;:,.c J i (
lgpleaent
~:he
''1 )<0
of
exa~plc
23.F.2,
and
in
FrODJ symmetry and the fact that
for all l.e{l,f). l. -
Therefore,
Ye
~an
r•sult of (2l.F.9) using a second-price sealed-bid suction
with a reserve price of I.
In the general ease,
f~r
sell•r can then offer
each bidder 1 there exists 1
such that J (6l)
auction where each agent l 1• restricted to submit
A
bids greater than
't·
and the •sent which gene~ates the highest Jl(li) wins
"
the anetian.
If agent 1 von the auction. ve calculate th• value
-t
1
such thot •
.
' ' " ' ..
•
13 • 2S
A
generates the second. highest J( ·) sene rated), and agent 1 pays NaxU , i L 1 1
on thls •ee Bullow and
(For
23.F.4.
Robe~t•
(1989]).
The analysis of example 23.F.2. applie• here es well, yet the --
objeetive funetion in (23.F.8) changes and
b•co~s: .
•
•
•
•
1
'1 .
•
+
'o
1 n - 1 <• 1 >Jds 1 ···dl 1
1
i-1
~1 and therefore, (2J.F.9) becomes:
if
yl(l) - 1 •
•
and
q3.F.S.
Letting p Cx ) 1 1
(a)
•
d~note
agent i's inverse des.nd function, the
monopolist' s· probleat b: •
Using Kuhn-Tucker, the FOes are:
•
Therefore, depending of the x
(b)
1
on
the deMand f1.1.n4:Uon.s we will have one, both, or none·
pos 1 tive, and there sum baing lass than one.
The results here resemble
~ose
of example 2J.F.2.
The monopolist sets • ••
priees
(quantities)
tl)
aa.ximlu hll payoff.
Interpreting q1.1antltbs as •
•
prohab111ties, and prices es valuations, tha results here are ai•ilar to the •
23 • 26
•
(1-). fle C1le •
ttw fta. tt - p•.-(p) +
~.
'!Mit.. •tC.,I) •
11"1 ~ t:H
•
•
1lil
Y
(k) + 1
't•
PrOf!INildoa 23 •.D.2 tel!. u
lf - ' only f)) ••
(l)
+ ·1. _.
v.1 Ca.l) •
Wtala
. . [p(l),!(l)).
[,(f)w%(1)} U
(Ul
11·-t
if·~
• ••• ' p(l) ...
u<•> .. • • , v1 c.,. •
t
••J•t
t:o u(l)
a
0 for 1111 ' ' . . •
(f(l),u(l)).
-
a'b.v.. tlnu a(l) - f(l) ·ia(f(l)) the objectl.,.
... -<•>• • (u(l) + lx(p(l))
J(f)
• p(l)a(p(l))l
... • ( f ) f(l)
1
-
u(l)~(l)dl
-
Substituting, we want to
u(l).(ll
' 1 -
-
-
'
1
-
u'(l).(l)dl
' - u(l) + x(p(l)).(l)dl . 1 choose [p(l),u(l)] to solve,
•
-
- (1-a)u(i) •
s.t.
u(i) ~ 0
(i)
(which implies u(l) ~ 0 for all I)
(ii) p(8) is non-decreasing. Start by setting
u(f)
- 0, and let's ignore constraint (ii).
Taking the FOC
w.r.t. p(l), we get, -x(p(f)) + x(p(l)) + (p(l) - l)x' (p(B)) rearranging and dividing by x' (p(l)) we get, p(l) - ' + So,
•(8)
~(I)
nondecreasing and
{1-Q)
•<•> (1-a)~(B)
.
(*)
> 0 implies that constraint
satisfied, and (*) is the regulator's optimal price rule. want p(8) -
9.
(ii)
If a - 1 then we
If, however, a > 1, then we have no solution:
for any
transfer function e{·), we can increase "welfare" by raising it to e(·) + for
E
is
E
> 0.
23.F.7.
This question is analyzed in Dana-Spier (1994).
Following the
analysis in section 2 of the paper, one can derive the following "vir •
welfare function" corresponding to a monopoly awarded to f paper for
this
1 (see the
definition) : (1-c) 8
2
+
{1-c) 8
2
- '
for i-1,2
and the virtual welfare function associated with a duopoly is:
23 - 28
1
2
F(Bl) - (l-1) f(l ) 1
1 2 ri(B)-Max(l¥ (1) ,r.r (6) ,l'ld(l)),
The goverument awards a monopoly to firm i if .
d
~_2
1
for i-1,2
d
and a duopoly right if W (6)-Kax(l'l (l),r.r-(1),1'1 (9)).
23.F.8.
For both IL and 18 , the buyer
does.
s the good more than the seller
If y(l)
utility than the seller looses, and we can therefore increase the transfer e( 6) to (more than) compensate the seller for his loss so both agents are better off.
23.F.9.
Therefore,
(a) Ye can rewrite (23.F.l5) and (23.F.l6) as follows: t t
H H
Both the above yield that (b)
any ex post classically efficient social choice
-
tL
40(yH - yL)
(23.F.l5)
-
tL s 20(yH - yL)
(23.F.l6)
~
20(yH - yL)
~
(tH - tL)
~
40(y8 - yL)' which implies
t~tL.
ya--
ex post efficiency implies that yL-y -1. 8
This, with (23.F.l3) imply
•
that tL
~
~
tH 40.
40.
This in turn, together with ytL (from (i) above) imply that
Using these conclusions, we could evaluate the expected utility of
the buyer: Ell·
so that
2
-
.2(50 -
(23.F~l4)
~)
+ .8(30 - tL)
is violated.
s
.2(50 - 40) + .8(30 • 40)
(23.F.l6) together with
-6
Therefore, no feasible social choice function
can be ex post efficient. (c)
s
y~O
implies that:
tL - 20yL ~ tH - 20yh ~ tH - 40yH . •
23 - 29
23.F.10.
The set of interim efficient social choice .functions are those
that solve (23.F.l7) for some u ~
o· and ulH (the change is that we no longer 2
require u
:W o > . 1
The logic leading to 23. F .19 and Figure 23. F .l in the
textbook is unchanged from the logic in the textbook.
-u
Now, however, because
H can take on negative values the set of (yH,tH) pairs in interim incentive 1
efficient social choice functions
is the standard set in Figure 23. F .10
below:
1 The
boundary
at y -1 H
coaes
froa
the
feaaibility
requirement
that
Following, again, the same sort of logic as in the textbook (and of Figure 23.F.3 there),
the set of (yH,tH)
in ex ante incentive efficient social
choice functions is the heavily traced boundary at yh-1 in figure 23.F.l0 above.
Thus,
incentive
when trade
efficient
is not voluntary for
social
choice
functions
the seller, have
trade
all ex ante occurring
with
probability one.
23.AA.l.
Consider as a mechanism the following game where player 1 chooses
rows, 2 chooses columns, and the mechanism chooses the resulting outcome in the matrix:
23 - 30
player 2 1 m r
u player 1
b
a
c
C a
a
d
c
d
e
B
'i then U is his u~ique type 'i then C is his unique player 2's type is 'i then 1 is when she is type 'i then m is her
It is easy to check that if player l's type is •
.
(weakly) dominant strategy, and when he is (weakly) dominant strategy.
Similarly, if
her unique (weakly) dominant strategy, and unique (weakly) dominant strategy.
23.AA.2.
The answer to the first part is no.
This follows from the fact
that every possible valuation function arises from 8i for all i, so that for •
all aSR, and every 8i' there exists a '1 such that vi(kn,l1) - v 1 (k0 ,1i) +a. Therefore,
these two valuation functions, vi(kn,l1) and vi(kn,9i) not only
rank the projects ordinally the same, but measure the differences in utility between projects identically.
This implies that k * (li,l -·i)
which in turn implies that ti(8i,9-i) - ti(Bi,B-i) so agent i is indifferent between announcing Bi or the shifted '1· This
is
the
only
type
of modification
that
would
keep
the
agent
indifferent, implying that the answer to the second art of the question is no.
If
the
agent
"anchored" to zero,
chooses
to misrepresent,
since
the
value
of
k0
is
then any misrepresentation must involve changing the
monetary values of the differences between some alternatives, which might change the decision of the optimal project, which in turn will change the utility of the deviant agent.
therefore, truth-telling will be the unique
(weakly) dominant strategy.
23 - 31
23.BB.l. described,
1 form game associated with the extensive
(a) In the no
agent 1 has three strategies,
(Ly,Lz,cy,cz}
(where "aP" means
•announce a, and if challenged choose p•) and agent 2 has two strategies: (A,C} for "Accept" or •Reject".
and extensive f
The
games can be
depicted as shown in the following figure: 2
A Ly 1
Lz cy cz
X X X X
L L
C X X
1
L L
X
2
L
A
c c
X
z
c
z
y
It is easy to check that (cz,A) and (La,C), ae(y,z} are both Nash equilibria game, and therefore, any strategy profile which
outcoaes in the normal
supports these outcoaes will be a Nash equilibri (b) Looking at the extensive form of the
•
and using backward induction
for each type profile, it is easy to check that the only strategy profile which is a sub game perfect equilibrium is:
23.81.2. equilibr
Clearly,
Ly
if 1 -L
c
cz
if
e1-c
A
1
0
any equilibrium
in dominant
strategies
, so the answer to the first part is "yes".
is
a
Nash
If the dominant
strategy equilibrium is strict (i.e., not weakly dominant) then clearly we would have strong implementation. d0111inant equilibrium is weak.
However, this
is not the case if the
Consider the following example:
Two agents, 1 and 2, with the following preferences:
23 - 32
b-e a
and the social choice function (SCF) is f(1i•'2)-a. f(6i,62)•c, and f(6i,62)f(6i,12)-b. dominant
It is easy to check that this SCF is implementable· in ·(weakly) However,
strategies.
to
see
that
it
announces herself to be a 6i type.
'i
not
strongly. Nash
of the direct mechanism:
implementable, the following is a Nash equilibri agent 1 always announces hiaself to be a
is
type,
and agent 2 always
This is a NE that always implements
outcome b, no matter the types, and therefore it does not implement£(·).
~
23.88.3.
Property (i) must be satisfied.
· By Proposition 23.BB.l. if f(·) is Nash implementable the f(·)
Let 6-(li,l-i) be such that k * (6)-1, and let l'•{li•'-i) satisfy
monotonic.
* Similarly, if k {6)-0, and
* 61 > 6i, so monotonicity implies that k {9')-1. ) satisfies 81 1. - i
6'-(6'
is
6
s 8i, then
*
k -(9'
)-0.
Now
in negation that
•
property (i) didn't hold, e.g., w.l.o.g. assume that ti(8f.'6-i) > t 1 (6i,6-i). Then when agent i's type is 61, and all others' are 6-i' then agent i would prefer to misrepresent and announce 6i instead, contradicting that f(·) is Nash implementable. ~
P~onf:
Therefore, we must have ti(81,6-i)- ti(6i,6-i).
Property (ii) need not be satisfied.
Consider a SCF that is implementable in Strong Nash equilib
proposition 23.BB.l such a SCF must satisfy monotonicity. if k * (6'.,6 i) 1
However,
-
this
1 and k * ( ei. , 6 _ 1 ) -
imposes
no
•
By
This implies that
0 then we must have that 61 > 6 i .
r~strictions
on the
change
in
the vector
of
Therefore, any change will be compatible with monotonicity, and we need only to satisfy incentive compatibility which can be satisfied in many ways.
23 - 33
u (1,x,t) - lv(x) - t (so that a higher I results in a higher utility leve 1
and a higher marginal condition).
utility
-
the
latter
The sellers utility is given by
is
the
•single
u (1,x, t) 0
t
-
crossing•
c·x •
Using
the revelation principal we can concentrate on a direct mechanism (x(l),t(l)) which solves the sellers problem:
Max
E[t(l) - c·x(l)]
x(l),t(l) s.t.
(x(l),t(l)) is Bayesian incentive compatible and individually rational.
Ye now follow the analysis of linear utility in section 23.D
-v(f)-v(x(l))].
Letting
u1 (1)
-
[with~.
and
lv(x(l)) - t(l) denote the utility of type
I from truth-telling, proposition 23.D.2 implies that the principal's
problem is equivalent to (recall that Y(·)>O so that constraint (i) can be written as shown below): Max x(l) ,U(I) s.t.
E[lv(x(l)) - U(l) - cx(l)] (i) x(·) is non-decreasing 9
(ii) U(O) - U(!) +
(iii)U(I) ~ 0
J v{x(s))ds '-
for all ee[9,i]
-
for all le[e,i]
Following the same steps as in example 23.F.l the problem becomes:
-9 Max x(9) ,U(O)
- ex ( e) ]; (·I ) de
[6v(x(9))
's.t.
(i) x(·) is non-decreasing (ii) U(l)
-
?;
0
-
u(e- )
23.F.6.
Let x- (p,T) where p is the price and T is the
revenue given
•
to the firm, T- p•x(p) + t. Then, ui(x,l)- 1[-x(p)] + T, and using the notation on page 887 of the textbook we obtain that u (x, I) - vi (k) + ti, 1
Which in tULb is equal tO Vi(k). a)
Consider a mechanism as [p(l) ,T(I)].
Then Proposition 23.D.2 tells us
that [p(B),T(I)] is implementable if and only if, (i)
-x(p(f)) is non-decreasing, i.e., p(l) is non-decreasing,
(ii) u(l)- u(!) +
' vi(s)ds 1 8
- u(l) -
-
-
b)
u(l) +
1
x(p(s))ds
' x(p(s))ds
1
The regulator wants to choose [p(B),T(I)], or equivalencly, [p(l),u(B)],
to maximize,
' 'subject to u(8) above.
~
0 for all 8,
and che two conditions given in part a)
Since u(9) - T(l) -9x(p(l)) the objective function can be rewritten
as,
' 9 ' - 9 •
x(s)ds - (u(8) + lx(p(l}) - p(9)x(p(8))} p(l) x(s)ds p(9)
+ au(l) ;(l)d9
- [p(l) -l]x(p(l)) - (1 - a)u(l) ;(l)dl .
Using integration by parts we have,