KnapsackAuction.natBinarySocialWelfare
defimported Lean
Integer-valued welfare of a binary allocation profile.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in variable {I : Type*} [Fintype I] [DecidableEq I] in def KnapsackAuction.natBinarySocialWelfare (b : I → Nat) (x : BinaryAllocation I) : Nat
- Defined in
- EconCSLib, `KnapsackAuction.natBinarySocialWelfare`
- 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.KnapsackAuction.natBinarySocialWelfare← KnapsackAuction.natBinarySocialWelfare (EconCSLib/MechanismDesign/Auction/Knapsack.lean:423): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- Used by 9
- KnapsackAuction.dpSolveList_supportedOnKnapsackAuction.dpSolveList_supportedOn
- KnapsackAuction.fractionalSocialWelfare_realBidOfNat_binaryToAllocationKnapsackAuction.fractionalSocialWelfare_realBidOfNat_binaryToAllocation
- KnapsackAuction.natBinarySocialWelfare_update_true_of_falseKnapsackAuction.natBinarySocialWelfare_update_true_of_false
- KnapsackAuction.dynamicProgrammingOptimalValueThe social welfare achieved by the dynamic-programming allocation.
- KnapsackAuction.natBinarySocialWelfare_eq_add_of_trueKnapsackAuction.natBinarySocialWelfare_eq_add_of_true
- KnapsackAuction.dpSolveListA computable dynamic-programming solver for finite
0/1knapsack instances. The solver processes the agents in the given list order and… - KnapsackAuction.integralGreedyValueWelfare of the ratio-sorted integral greedy allocation.
- KnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highestKnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highest
- KnapsackAuction.natFractionalGreedyValue_le_integralGreedyValue_plus_highestKnapsackAuction.natFractionalGreedyValue_le_integralGreedyValue_plus_highest
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in variable {I : Type*} [Fintype I] [DecidableEq I] in /-- Integer-valued welfare of a binary allocation profile. -/ def KnapsackAuction.natBinarySocialWelfare (b : I → Nat) (x : BinaryAllocation I) : Nat := ∑ i, if x i then b i else 0