SocialChoice.FairDivision.Indivisible.bestGood
defimported Lean
bestGood I i s hs is a good in s maximizing agent i's item weight.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {n : ℕ} {G : Type*} in variable [NeZero n] in noncomputable def SocialChoice.FairDivision.Indivisible.bestGood [DecidableEq G] (I : AdditiveInstance (Fin n) G) (i : Fin n) (s : Finset G) (hs : s.Nonempty) : G
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Indivisible.bestGood`
- 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.bestGood← SocialChoice.FairDivision.Indivisible.bestGood (EconCSLib/SocialChoice/FairDivision/Indivisible/RoundRobin.lean:695): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- SocialChoice.FairDivision.Indivisible.AdditiveInstance.toAdditiveValuationThe raw additive valuation induced by additive per-item weights.
- SocialChoice.FairDivision.Indivisible.AdditiveInstanceAn additive indivisible-goods instance, represented by per-item weights.
- SocialChoice.FairDivision.Indivisible.rawBestGood
rawBestGood w i s hsis a good insthat maximisesw.weight iovers. Defined noncomputably viaClassical.chooseon…
- Used by 2
- SocialChoice.FairDivision.Indivisible.bestGood_mem
bestGoodlies in the candidate set. - SocialChoice.FairDivision.Indivisible.bestGood_leEvery candidate good has no larger weight than
bestGood.
- SocialChoice.FairDivision.Indivisible.bestGood_mem
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators in variable {n : ℕ} {G : Type*} in variable [NeZero n] in /-- `bestGood I i s hs` is a good in `s` maximizing agent `i`'s item weight. -/ noncomputable def SocialChoice.FairDivision.Indivisible.bestGood [DecidableEq G] (I : AdditiveInstance (Fin n) G) (i : Fin n) (s : Finset G) (hs : s.Nonempty) : G := rawBestGood I.toAdditiveValuation i s hs