Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1, p. 10 — both firms find knowledge sharing privately profitable iff V − I ≥ |π_F − π_A|

Proved
AlliancePortfolio.Sharing.proposition_1

by mikedeng1 · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

alliancesknowledge-sharingnash-bargainingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1property-rights

Consider a single alliance between firms FFF and AAA with alliance value VVV, ex post outside options πF\pi_FπF​ and πA\pi_AπA​ satisfying V≥πF+πAV \ge \pi_F + \pi_AV≥πF​+πA​, and total knowledge-sharing cost I>0I > 0I>0, each firm paying 12I\tfrac12 I21​I. Firm iii's Nash-bargaining payoff is Πi=πi+12[V−πF−πA]−12I\Pi_i = \pi_i + \tfrac12[V - \pi_F - \pi_A] - \tfrac12 IΠi​=πi​+21​[V−πF​−πA​]−21​I, and knowledge sharing is privately profitable for iii when Πi≥0\Pi_i \ge 0Πi​≥0.

Then knowledge sharing is privately profitable for both firms if and only if

V−I≥∣πF−πA∣.V - I \ge |\pi_F - \pi_A| .V−I≥∣πF​−πA​∣.

The result says that value creation (V≥IV \ge IV≥I, the efficiency condition) is not enough: shifts in bargaining positions caused by knowledge sharing, measured by ∣πF−πA∣|\pi_F - \pi_A|∣πF​−πA​∣, can lead to underinvestment.

Formalization Note Proposition 1 also says knowledge sharing "is efficient when V≥IV \ge IV≥I"; that sentence is the paper's definition of efficiency and is not part of the formal statement. The paper writes "only when"; the constraint-level statement is an equivalence, because the paper rewrites the two constraints (2) equivalently as (3) and (4) on p. 9. The standing assumptions I>0I > 0I>0 and V≥πF+πAV \ge \pi_F + \pi_AV≥πF​+πA​ of §2 are kept as hypotheses.

Preamble
import Mathlib
import Definitions.Def_Supermodularity_Cooperative_ShapleyValue
import Definitions.Def_AlliancePortfolio_Sharing_Model
Formal statement
namespace AlliancePortfolio.Sharing

theorem proposition_1 (V I πF πA : ℝ) (hI : 0 < I) (hV : πF + πA ≤ V) :
    SingleFeasible V I πF πA ↔ |πF - πA| ≤ V - I := by sorry

end AlliancePortfolio.Sharing
Source
Arora, Belenzon & Patacconi, Knowledge sharing in alliances and alliance portfolios, author manuscript of January 24, 2020 (Management Science 2021, doi:10.1287/mnsc.2020.3614), p. 10, Proposition 1 (eq. (5)); pp. 7–9, eq. (1)–(4)
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 20, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me