Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (11), p. 24 — Π_A, Π_B ≥ 0 iff V − I − π_F + (2/3)b − (1/3)(s^Imp − s^RB) ≥ 0

Proved
AlliancePortfolio.Sharing.eq_11

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

alliancesknowledge-sharingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1shapley-value

In the alliance portfolio with players {F,A,B}\{F, A, B\}{F,A,B}, let φA,φB\varphi_A, \varphi_BφA​,φB​ be the Shapley values of the Table 1 game and let the net payoffs of the partners be ΠA=φA−12I\Pi_A = \varphi_A - \tfrac12 IΠA​=φA​−21​I and ΠB=φB−12I\Pi_B = \varphi_B - \tfrac12 IΠB​=φB​−21​I, where 12I\tfrac12 I21​I is each partner's knowledge-sharing cost.

Then the knowledge-sharing constraints of both "weak" partners hold if and only if

ΠA≥0 and ΠB≥0  ⟺  V−I−πF+23b−13(sImp−sRB)≥0.\Pi_A \ge 0 \text{ and } \Pi_B \ge 0 \iff V - I - \pi_F + \tfrac23 b - \tfrac13\bigl(s^{Imp} - s^{RB}\bigr) \ge 0 .ΠA​≥0 and ΠB​≥0⟺V−I−πF​+32​b−31​(sImp−sRB)≥0.

This condition drives the comparative statics of Proposition 5 and the lower end of the interval in Proposition 6.

Formalization Note The equivalence holds for all real parameters, so no hypotheses are needed.

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

theorem eq_11 (V I b πF sImp sRB : ℝ) :
    (0 ≤ netPayoff V I b πF sImp sRB A ∧ 0 ≤ netPayoff V I b πF sImp sRB B) ↔
      0 ≤ V - I - πF + (2 / 3) * b - (1 / 3) * (sImp - sRB) := 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. 24, equation (11)
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