Assumption 2: For any ? β ?, define the set of strictly preferred allocations:
A.2 Additional Proofs and Results from Section 3
Proof of Lemma 1: Note that there must be values πππ and πππβ² such that:
Proof of Proposition 3: From lemma 1 and prices being bounded away from zero, we can always find a value of πΜπ such that:
Proof of Theorem 2: From lemma 2 and rationalizability of the data:
65
β« [ππ€π(ππ(πππ ); ππ) + [πππ β πΜ ] π(ππ(πππ ); ππ, ππ)]ππΉπβ²β²π ,π,π(πππ , ππ, ππ)
πππ ,ππ
β₯ β« [ππ€π(πππ ; ππ) + [πππ β πΜ ] π(πππ ; ππ, ππ)] ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
β« [ππ€π(ππ(πππ ); ππ) + πππ π(ππ(πππ ); ππ, ππ)]ππΉπβ²β²π ,π,π(πππ , ππ, ππ)
πππ ,ππ
β₯ β« [ππ€π(πππ ; ππ) + πππ π(πππ ; ππ, ππ)] ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
β« [ππ€π(ππ(πππ ); ππ) + [πππ β πΜπ ] π(ππ(πππ ); ππ, ππ)]ππΉπβ²β²π ,π,π(πππ , ππ, ππ)
πππ ,ππ
β₯ β« [ππ€π(πππ ; ππ) + [πππ β πΜπ ] π(πππ ; ππ, ππ)] ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
Rearranging yields:
β« ππ€π(ππ(πππ ); ππ)ππΉπβ²β²π ,π,π(πππ , ππ, ππ)
πππ ,ππ
β₯ β« ππ€π(πππ ; ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
β β« [πππ β πΜπ ] π(ππ(πππ ); ππ, ππ)ππΉπβ²β²π ,π,π(πππ , ππ, ππ)
πππ ,ππ
+ β« [πππ β πΜπ ] π(πππ ; ππ, ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
We can show from lemma 1 and πππ β [πΜ , πΜ + πΜ π] = π« βπ that the last two terms total to a a non-negative value. Formally, for any πππ β (πΜ , πΜ + πΜ π), ππ, ππ, ππβ²:
πππ > πΜπ β ππ(πππ ) > πΜπ β π(ππ(πππ ); ππ, ππβ²) β€ π(πππ ; ππ, ππ) πππ β€ πΜπ β ππ(πππ ) < πΜπ β π(ππ(πππ ); ππ, ππ, ππβ²) β₯ π(πππ ; ππ, ππ) Either way:
66
[πππ β πΜπ ] π(ππ(πππ ); ππ, ππ, ππβ²) β€ [πππ β πΜπ ] π(πππ ; ππ, ππ) Thus:
β« [πππ β πΜπ ] π(πππ ; ππ, ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
= β« [πππ β πΜπ ] π(πππ ; ππ, ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ βπππ‘(π«),ππ,ππ
+ β« [πππ β πΜπ ] π(πππ ; ππ, ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ βππ«,ππ,ππ
β₯ β« [πππ β πΜπ ] π(ππ(πππ ); ππ, ππ)ππΉπβ²β²π ,π,π(πππ , ππ, ππ)
πππ βπππ‘(π«),ππ,ππ
+ β« [πππ β πΜπ ] π(πππ ; ππ, ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ βππ«,ππ,ππ
= β« [πππ β πΜπ ] π(ππ(πππ ); ππ, ππ)ππΉπβ²β²π ,π,π(πππ , ππ, ππ)
πππ ,ππ
β« ππ€π(ππ(πππ ); ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ
β₯ β« ππ€π(πππ ; ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
β
We now proceed to proving Theorem 3, i.e. that deadweight loss is maximized given the available data and distribution πΉπβ by having a cutoff value Ξ such that the ratio of
ππ€π(πΜ + πΜ π; ππ, β) to π(πΜ + πΜ π; ππ, π) β π(πΜ + πΜ π; ππ, β) is greater (less than) Ξ for those we assign a perceived price of πΜ + πΜ π (respectively πΜ ). However, we must also consider the choice of conditional distribution of π. Toward that end, we note that deadweight loss is bounded by the product of the reduction in demand and πΜ π.
Lemma 5: If πππ β [πΜ , πΜ + πΜ π], then ππ€π(πππ ; ππ, ππ) β€ [π(πΜ ; ππ, ππ) β π(πππ ; ππ, ππ)] πΜ π βππ, ππ. Proof: Using lemma 2:
0 = ππ€π(πΜ ; ππ, ππ) β₯ ππ€π(πππ ; ππ, ππ) β [πππ β πΜ ] β [π(πΜ ; ππ, ππ) β π(πππ ; ππ, ππ)]
67
ππ€π(πππ ; ππ, ππ) β€ [π(πΜ ; ππ, ππ) β π(πππ ; ππ, ππ)] β [πππ β πΜ ] β€ [π(πΜ ; ππ, ππ) β π(πππ ; ππ, ππ)] πΜ π β Proof of Theorem 3: The outline of the proof is as follows. First, we use lemma 5 to show that the maximal deadweight loss consistent with aggregate demand and πΉπβ comes from a data-generating process in which agents perceiving the price πΜ + πΜ π choose the lowest quantity consistent with preference maximization, whereas the other agents choose the largest such quantity. Then, we show that distributions satisfying such a property yield deadweight loss no larger than the proposed distribution, which exists.
First, consider an arbitrary distribution πΉππ ,π,π (yielding well-defined aggregate demand and deadweight loss) such that πΉπ = πΉπβ and:
πΉππ = {
0, πππ < πΜ
πΉππ (πΜ ), πππ β [πΜ , πΜ + πΜ π) 1, πππ β₯ πΜ + πΜ π
In words, the above expression says that the support of ππ is contained in {πΜ , πΜ + πΜ π}. By Theorem 2, the maximal value of deadweight loss consistent with aggregate demand and πΉπβ must satisfy this property. Consider some value π β [0,1] such that:
π β« π(πΜ + πΜ π; ππ, π) ππΉπ|ππ β πΜ (ππ)
ππ
+ (1 β π) β« π(πΜ ; ππ, β)ππΉπ|ππ =πΜ (ππ)
ππ
= β« π(πππ ; ππ, ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
(10)
Such a value of π must exist by the Intermediate Value Theorem, since by the definitions of π &
β and the CLD as expressed in lemma 1:
β« π(πΜ + πΜ π; ππ, π)ππΉπ|ππ β πΜ (ππ)
ππ
β€ β« π(πππ ; ππ, ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
β€ β« π(πΜ ; ππ, β)ππΉπ|ππ =πΜ (ππ)
ππ
68
In words, we are constructing an alternative distribution that rationalizes aggregate demand such that ππ = πΜ + πΜ π & π = π with probability π, and otherwise ππ = πΜ & π = β. We now show that this alternate distribution yields at least as much deadweight loss, thus showing that the maximal value of deadweight loss consistent with aggregate demand and πΉπβ must arise from a distribution in which almost surely (ππ , π) = (πΜ , β) or (ππ , π) = (πΜ + πΜ π, π).
From the definition of deadweight loss:
β« πΜ π [π(πΜ ; ππ, ππ) β π(πΜ ; ππ, π)] ππΉπ,π|ππ β πΜ (ππ, ππ)
ππ,ππ
= β« [ππ€π(πΜ + πΜ π; ππ, π) β ππ€π(πΜ ; ππ, ππ)] ππΉπ,π|ππ β πΜ (ππ, ππ)
ππ,ππ
From here, the definition of π, and using the fact that ππ€π(πΜ ; ππ, ππ) = 0 βππ, ππ, we have that π β₯ 1 β πΉππ (πΜ ) implies that:
π β« ππ€π(πΜ + πΜ π; ππ, π)ππΉπ|ππ β πΜ (ππ)
ππ
+ (1 β π) β« ππ€π(πΜ ; ππ, β)ππΉπ|ππ =πΜ (ππ)
ππ
= π β« ππ€π(πΜ + πΜ π; ππ, π)ππΉπ|ππ β πΜ (ππ)
ππ
β₯ [1 β πΉππ (πΜ )] β« ππ€π(πΜ + πΜ π; ππ, π)ππΉπ|ππ β πΜ (ππ)
ππ
= [1 β πΉππ (πΜ )] β« ππ€π(πΜ + πΜ π; ππ, ππ)ππΉπ,π|ππ β πΜ (ππ)
ππ,ππ
+ πΉππ (πΜ ) β« ππ€π(πΜ ; ππ, ππ)ππΉπ,π|ππ =πΜ (ππ, ππ)
ππ,ππ
= β« ππ€π(πΜ + πΜ π; ππ, ππ)ππΉπ,π(ππ)
ππ,ππ
69
The inequality follows from π β₯ 1 β πΉππ (πΜ ) by assumption. This shows that whenever π β₯ 1 β πΉππ (πΜ ), the proposed alternative distribution yields at least as much deadweight loss. Now suppose instead π < 1 β πΉππ (πΜ ). From lemma 5:
β« ππ€π(πΜ + πΜ π; ππ, ππ)ππΉπ,π|ππ β πΜ (ππ, ππ)
ππ,ππ
β₯ πΜ π β« [π(πΜ ; ππ, β) β π(πΜ + πΜ π; ππ, ππ)] πΜ πππΉπ,π|ππ β πΜ (ππ, ππ)
ππ,ππ
In addition, we find it convenient to rewrite the aggregate demand-rationalizing equation as:
β« π(πππ ; ππ, ππ)ππΉππ ,π,π(πππ , ππ, ππ)
πππ ,ππ,ππ
= [1 β πΉππ (πΜ )] β« π(πΜ + πΜ π; ππ , ππ)ππΉπ,π|ππ β πΜ (ππ, ππ)
ππ,ππ
+ πΉππ (πΜ ) β« π(πΜ ; ππ, ππ)ππΉπ,π|ππ =πΜ (ππ, ππ)
ππ,ππ
And so, using equation (10) and rearranging terms:
π β« [π(πΜ + πΜ π; ππ , ππ) β π(πΜ + πΜ π; ππ , π)]ππΉπ,π(ππ, ππ)
ππ,ππ
= (1 β π) β« π(πΜ ; ππ, β)ππΉπ|ππ =πΜ (ππ)
ππ
β [1 β πΉππ (πΜ ) β π] β« π(πΜ + πΜ π; ππ, ππ)ππΉπ,π|ππ β πΜ (ππ, ππ)
ππ,ππ
β πΉππ (πΜ ) β« π(πΜ + πΜ π; ππ, ππ)ππΉπ,π|ππ β πΜ (ππ, ππ)
ππ,ππ
Using lemma 5 and plugging in yields:
Ο
Thus, we know that the maximal deadweight loss consistent with aggregate demand andFΞΈβ is generated by a distribution in which with probability one either(ps, ΞΆ) = (Β―p, h) or (ps, ΞΆ) = (Β―p + Β―mΟ, l). We refer to distributions of this sort as binary distributions.
Now, we show that the proposed distribution maximizes deadweight loss among all binary
70
distributions, and thus among all distributions, that rationalize aggregate demand such that FΞΈ = FΞΈβ. Towards that end, we first show that the proposed distribution exists. Note by lemma 5 and the CLD as in lemma 1:
In words, aggregate demand is contained between when all agents perceive a high price &
have typeh and when all agents perceive a low price & have type l. Furthermore, one can confirm that for anyβ, β0, Ξ³, Ξ³0such that0 β€ β < β0 β€ Β―mΟ and 0 β€ Ξ³ < Ξ³0 β€ 1:
Thus, we can pickβ such that:
Z
If both sides hold with equality, we can defineΞ³ arbitrarily. Otherwise, we define Ξ³ so that the market clears:
We now have the valuesβ and Ξ³ such that the market clears. Suppressing β and Ξ³ subscripts fromq, we can say that:Λ
Finally, to show that the proposed distribution maximizes deadweight loss, consider ar-bitrary binary distribution Fps,ΞΈ,ΞΆ that rationalizes aggregate demand. Defining PF(ps 6=
Β―
p|ΞΈi) β‘ 1 β Fps|ΞΈ=ΞΈi(Β―p + Β―mΟ ) as the probability that (ps, ΞΆ) = (Β―p + Β―mΟ, l) conditional on ΞΈi, 71
rationalizing aggregate demand withFΞΈ = FΞΈβmeans that:
We can now write the difference in generated values of aggregate deadweight loss as:
Z
We complete the proof by showing the right-hand side of the last inequality is zero. Since both distributions rationalize the same aggregate demand:
Z
Subtracting both sides fromR
Finally, subtracting the right-hand side from the left-hand size and multiplying by zero yields the desired result. Thus:
Z
ΞΈi
q(ΞΈΛ i) β q(Β―p; ΞΈi, h)
q(Β―p + Β―mΟ ; ΞΈi, l) β q(Β―p; ΞΈi, h)β PF(ps6= Β―p|ΞΈi)dwl(Β―p + Β―mΟ ; ΞΈi, l)dFΞΈβ(ΞΈi) = 0
In words, deadweight loss from the proposed distribution is at least as great as the dead-weight loss from any binary distribution that also rationalizes aggregate demand and with the true distribution of preference types. From the first part of the proof, any distribution that rationalized aggregate demand and had the support of perceived prices contained inβdP yielded deadweight loss no greater than what one could obtain with a binary distribution that rationalized aggregate demand withFΞΈ = FΞΈβ. Theorem 2 noted that any distribution that rationalized aggregate demand withFΞΈ = FΞΈβ yielded deadweight loss no greater than that one could obtain with a distribution that had the support of perceived prices contained inβdP, rationalized aggregate demand, and had FΞΈ = FΞΈβ. Therefore, any distribution that rationalizes aggregate demand and withFΞΈ= FΞΈβyields deadweight loss no greater than the proposed distribution.
Claim: Ifmit β₯ Ξ²it,Ξ²it β€ 0 with probability one, and mithas an exponential distribution, then:
m β€ 0.5 β E[dwlΛ it|Ο ] β€ β1
2E[Ξ²Λit]Ο2βΟ
Proof : Since the variance of an exponentially-distributed random variable is its squared
ex-pected value:
E(m2it) = V ar(mit) + (E[mit])2= 2(E[mit])2
73
74
Also, from the independence of salience and sticker price responsiveness:
πΜ = πΌ[π½Μππ‘]