Proposition 1, p. 10 — additivity and zero truncation hold iff
ProvedSeqLoss.FixedFraction.proposition_1axiomatic-characterizationcost-sharingliabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
A rule satisfies additivity and zero truncation if and only if, for each , each and each agent ,
where the sum runs over and is the elementary -loss problem (agent is an agent of ).
The proposition reduces the choice of an additive, zero-truncating rule to its values on the elementary problems.
Formalization Note. Agents are 0-based. The term is φ (j+1) (elem (j+1)) ⟨i, _⟩ for 0-based ; the sum is written over all with the summand for . Both sides are compared on loss vectors only.
Preamble
import Mathlib import Definitions.Def_SeqLoss_FixedFraction_Setting import Definitions.Def_SeqLoss_FixedFraction_Axioms
Formal statement
namespace SeqLoss.FixedFraction
theorem proposition_1 (φ : (n : ℕ) → (Fin n → ℝ) → (Fin n → ℝ)) (hφ : IsRule φ) :
(Additive φ ∧ ZeroTruncation φ) ↔
∀ n (ℓ : Fin n → ℝ), IsLoss ℓ → ∀ i : Fin n,
φ n ℓ i = ∑ j : Fin n,
if h : i ≤ j then ℓ j * φ (j.val + 1) (elem (j.val + 1)) ⟨i.val, Nat.lt_succ_of_le h⟩
else 0 := by sorry
end SeqLoss.FixedFraction
Source
Gudmundsson, Hougaard & Ko, Sharing Sequentially Triggered Losses: Automated Conflict Resolution Through Smart Contracts, accepted manuscript (2023), Management Science 70(3) 1773–1786, doi:10.1287/mnsc.2023.4772, p. 10, §3.1, Proposition 1; proof Appendix A, p. 22
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.