(A.1):
ProvedIncentivesInTeams.Conglomerate.appendix_A1Consider a conglomerate model whose component weights are probability weights, a joint strategy , constants , a subunit and a strategy . Let be the incentive structure (3.5) built from and the constants . Then
where is the expected value of subunit 's payoff under and is the expected organization payoff.
Up to the constant , a subunit's expected reward under equals the expected payoff of the whole organization, whatever strategy the subunit plays while the others follow . This is the identity to which the paper reduces Theorem 1.
import Mathlib import Definitions.Def_IncentivesInTeams_Conglomerate_Model
namespace IncentivesInTeams.Conglomerate
theorem appendix_A1 {ι : Type*} [Fintype ι] [DecidableEq ι] {S₀ : Type*} [Fintype S₀] {S : ι → Type*}
[∀ i, Fintype (S i)] {Z₀ : Type*} {Z M₀ M : ι → Type*} {D₀ : Type*} {D : ι → Type*}
(T : Model S₀ S Z₀ Z M₀ M D₀ D) (hT : T.WeightsOK)
(βs : JointStrategy S₀ S Z₀ Z M₀ M D₀ D) (A : ι → ℝ) (i : ι)
(b : SubStrategy (S i) (Z i) (M₀ i) (M i) (D i)) (hb : b ∈ T.B i) :
T.expect (T.WII βs A i (βs.update i b)) + A i = T.expOrgPayoff (βs.update i b) := by sorry
end IncentivesInTeams.Conglomerate
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. is a finite set of subunits. and each are finite. The weights and are assumed to be probability weights (nonnegative, each summing to ), with and . The payoffs are and .
A joint strategy consists of:
- head functions , and ;
- subunit functions , and .
Its information maps are and . The payoff components are
and the expected organization payoff is
The functions built from . Fix and real constants . For :
- the head factor is
- for each , the subunit factor is
where , with value when the denominator is ;
- the incentive payoff is
Theorem. Take a joint strategy , constants , a subunit , and a subunit- strategy . Let be with subunit 's strategy replaced by . Then
is not required to lie in any strategy set, and no positivity of any conditioning event is assumed.
Degenerate cases.
- The weight hypothesis forces every state set to be nonempty.
- Wherever a conditioning event has weight , the corresponding or takes the value .
- If , the sum over is empty. The claim then reads .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.