Proposition 7 — equilibrium information sharing under concurrent and sequential contracting (production economy)
DisprovedInfoSharing.Economy.proposition_7For every there are thresholds , depending only on , such that the following holds. Let , put , and let be reals. Let satisfy the signal model with variance and weight , let be any family of pricing equilibria with payoff table , and let be the number of informed manufacturers under concurrent () or sequential (, for either first mover) information contracting. Then
in the two-clause form: on each region the stated value of is attained by some outcome, and on the interior of the region it is the only value attained (at a boundary point the retailer is indifferent between outcomes). Precisely, with the set of values of over all concurrent outcomes (resp. all SPEs with first mover ): for ; on and on its interior; on and on its interior.
Under production economy the retailer shares information exactly when the economy is large relative to competition, whichever contracting sequence is used.
Formalization Note The production economy model takes with (the Assumption of p. 251). The ex ante profits are those of an equilibrium of the pricing game on the signal model, not the closed forms: the closed forms are the content of the §4.2 milestones. The production cost is the uncapped quadratic (the paper's cap at is assumed never to bind, footnote 11, p. 251). At every profit is independent of , so all three values are attained there. Correction of the paper. The single value (which lies in ) is excluded: there the slope of the best response (2) equals , so the pricing stage has a continuum of equilibria with different ex ante profits, and Lemma 1's uniqueness claim, on which the payoff table rests, fails.
Retired. Retired because the concurrent-outcome concept of Def_InfoSharing_Economy_IsConcurrentOutcome (supremum over Pareto-optimal equilibria) is not attained where π_M^I(1) − π_M(0) = π_M^I(2) − π_M^U(1), which refutes the closed threshold clauses (accepted disproof); replaced by InfoSharing.Economy.proposition_7_v2 on the corrected module _v2.
import Mathlib import Definitions.Def_InfoSharing_Shared_IsSignalModel import Definitions.Def_InfoSharing_Shared_PayoffTable import Definitions.Def_InfoSharing_Economy_IsConcurrentOutcome import Definitions.Def_InfoSharing_Shared_IsSequentialSPE open MeasureTheory open InfoSharing.Shared
namespace InfoSharing.Economy
/-- **Proposition 7** (Shang, Ha & Tong 2016, p. 256), production economy (`c = −c_e`) under
the Assumption `c_e < 2/(1+φ)`: the equilibrium number `n_e^Z` of informed manufacturers under
concurrent (`Z = C`) and sequential (`Z = S`, either first mover `k`) information contracting,
with thresholds `c_e^C`, `c_e^S` that depend only on `φ`. `ConcOptN P` and `SeqOptN P k` are the
sets of values of `n` over all outcomes; on each region `n` is attained, and it is the only
value in the region's interior (at the region boundaries the retailer is indifferent).
**Correction.** The value `c_e = (2+3φ)/((1+2φ)(1+φ))` is excluded: there the best-response
slope in (2) is `−1`, the pricing stage has a continuum of equilibria with different ex ante
profits, and Lemma 1's uniqueness (on which the paper's payoff table rests) fails. -/
theorem proposition_7 :
∀ φ : ℝ, 0 < φ → ∃ cC cS : ℝ,
1 / (1 + φ) < cC ∧ cC < 2 / (1 + φ) ∧ 1 / (1 + φ) < cS ∧ cS < 2 / (1 + φ) ∧
∀ (ce c a b σ β : ℝ) {Ω : Type*} [MeasurableSpace Ω] (μ : Measure Ω) (θ Y : Ω → ℝ)
(E : (Fin 2 → Status) → PricingProfile),
c = -ce → 0 < ce → ce < 2 / (1 + φ) → ce ≠ (2 + 3 * φ) / ((1 + 2 * φ) * (1 + φ)) →
IsSignalModel μ θ Y σ β →
IsPricingEqFamily μ θ Y a b c φ β E →
let P := payoffTable μ θ Y a b c φ E
((ce < 1 / (1 + φ) → ConcOptN P = {0}) ∧
(1 / (1 + φ) ≤ ce → ce < cC → 2 ∈ ConcOptN P) ∧
(1 / (1 + φ) < ce → ce < cC → ConcOptN P = {2}) ∧
(cC ≤ ce → 1 ∈ ConcOptN P) ∧
(cC < ce → ConcOptN P = {1})) ∧
∀ k : Fin 2,
((ce < 1 / (1 + φ) → SeqOptN P k = {0}) ∧
(1 / (1 + φ) ≤ ce → ce < cS → 2 ∈ SeqOptN P k) ∧
(1 / (1 + φ) < ce → ce < cS → SeqOptN P k = {2}) ∧
(cS ≤ ce → 1 ∈ SeqOptN P k) ∧
(cS < ce → SeqOptN P k = {1})) := by sorry
end InfoSharing.Economy
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.