KnapsackAuction.welfareMaximizer
defimported Lean
KnapsackAuction.welfareMaximizer
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open KnapsackAuction in open scoped BigOperators in variable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in variable [Fintype I] [DecidableEq I] in noncomputable def KnapsackAuction.welfareMaximizer (A : KnapsackAuction I U) (b : I → U) (hW : 0 ≤ A.totalCapacity) : BinaryAllocation I
- Defined in
- EconCSLib, `KnapsackAuction.welfareMaximizer`
- 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.welfareMaximizer← KnapsackAuction.welfareMaximizer (EconCSLib/MechanismDesign/Auction/Knapsack.lean:188): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 7
- KnapsackAuction.feasibleBinaryAllocationsThe finite list of binary allocations satisfying the knapsack constraint.
- KnapsackAuction.exists_welfareMaximizerA welfare-maximizing feasible binary allocation, chosen using
List.argMaxOnon the finite space of feasible0/1allocations. - KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- KnapsackAuction.binarySocialWelfareSocial welfare of a binary allocation profile at valuation profile
b.
- Used by 6
- KnapsackAuction.welfareMaximizer_geKnapsackAuction.welfareMaximizer_ge
- KnapsackAuction.welfareMaximizingAllocationRule_isMonotoneKnapsackAuction.welfareMaximizingAllocationRule_isMonotone
- KnapsackAuction.welfareMaximizingAllocationRuleThe welfare-maximizing allocation rule for the knapsack auction, obtained by choosing a feasible binary allocation with maximal social…
- KnapsackAuction.fractionalGreedyWelfare_ge_zeroOneWelfare_of_optimalIf the ratio-sorted greedy fractional allocation is optimal for the fractional relaxation, then its welfare dominates the welfare of the…
- KnapsackAuction.welfareMaximizer_mem_feasibleBinaryAllocationsKnapsackAuction.welfareMaximizer_mem_feasibleBinaryAllocations
- KnapsackAuction.maximalSocialWelfareThe maximal social welfare over the feasible binary allocation space.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open KnapsackAuction in open scoped BigOperators in variable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in variable [Fintype I] [DecidableEq I] in noncomputable def KnapsackAuction.welfareMaximizer (A : KnapsackAuction I U) (b : I → U) (hW : 0 ≤ A.totalCapacity) : BinaryAllocation I := by exact Classical.choose (A.exists_welfareMaximizer b hW)