KnapsackAuction.maximalSocialWelfare
defimported Lean
The maximal social welfare over the feasible binary allocation space.
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.maximalSocialWelfare (A : KnapsackAuction I U) (b : I → U) (hW : 0 ≤ A.totalCapacity) : U
- Defined in
- EconCSLib, `KnapsackAuction.maximalSocialWelfare`
- 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.maximalSocialWelfare← KnapsackAuction.maximalSocialWelfare (EconCSLib/MechanismDesign/Auction/Knapsack.lean:193): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- KnapsackAuction.welfareMaximizerKnapsackAuction.welfareMaximizer
- 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.binarySocialWelfareSocial welfare of a binary allocation profile at valuation profile
b.
- Used by 1
- 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…
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 /-- The maximal social welfare over the feasible binary allocation space. -/ noncomputable def KnapsackAuction.maximalSocialWelfare (A : KnapsackAuction I U) (b : I → U) (hW : 0 ≤ A.totalCapacity) : U := binarySocialWelfare b (A.welfareMaximizer b hW)