SocialChoice.FairDivision.Indivisible.AdditiveInstance.toAdditiveValuation
defimported Lean
The raw additive valuation induced by additive per-item weights.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open BigOperators in def SocialChoice.FairDivision.Indivisible.AdditiveInstance.toAdditiveValuation {N G : Type*} (I : AdditiveInstance N G) : AdditiveValuation N G
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Indivisible.AdditiveInstance.toAdditiveValuation`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.SocialChoice.FairDivision.Indivisible.AdditiveInstance.toAdditiveValuation← SocialChoice.FairDivision.Indivisible.AdditiveInstance.toAdditiveValuation (EconCSLib/SocialChoice/FairDivision/Indivisible/Instance.lean:163): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- SocialChoice.FairDivision.Indivisible.AdditiveInstanceAn additive indivisible-goods instance, represented by per-item weights.
- SocialChoice.FairDivision.Indivisible.AdditiveValuationAn additive valuation is determined by per-item weights.
weight i gis the value agentiassigns to goodgindividually. The bundle…
- Used by 4
- SocialChoice.FairDivision.Indivisible.AdditiveInstance.toValuationThe abstract valuation induced by additive per-item weights.
- SocialChoice.FairDivision.Indivisible.bestGood
bestGood I i s hsis a good insmaximizing agenti's item weight. - SocialChoice.FairDivision.Indivisible.bestGood_mem
bestGoodlies in the candidate set. - SocialChoice.FairDivision.Indivisible.bestGood_leEvery candidate good has no larger weight than
bestGood.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open BigOperators in /-- The raw additive valuation induced by additive per-item weights. -/ def SocialChoice.FairDivision.Indivisible.AdditiveInstance.toAdditiveValuation {N G : Type*} (I : AdditiveInstance N G) : AdditiveValuation N G where weight := I.weight