KnapsackAuction.dynamicProgrammingOptimalValue
defimported Lean
The social welfare achieved by the dynamic-programming allocation.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open KnapsackAuction in open scoped BigOperators in variable {I : Type*} [Fintype I] [DecidableEq I] in noncomputable def KnapsackAuction.dynamicProgrammingOptimalValue (w b : I → Nat) (capacity : Nat) : Nat
- Defined in
- EconCSLib, `KnapsackAuction.dynamicProgrammingOptimalValue`
- 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.dynamicProgrammingOptimalValue← KnapsackAuction.dynamicProgrammingOptimalValue (EconCSLib/MechanismDesign/Auction/Knapsack.lean:721): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- KnapsackAuction.dynamicProgrammingOptimalAllocationThe computable knapsack allocation obtained by running the dynamic program on the full finite agent list.
- KnapsackAuction.natBinarySocialWelfareInteger-valued welfare of a binary allocation profile.
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - KnapsackAuction.capacityThe total capacity bound.
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*} [Fintype I] [DecidableEq I] in /-- The social welfare achieved by the dynamic-programming allocation. -/ noncomputable def KnapsackAuction.dynamicProgrammingOptimalValue (w b : I → Nat) (capacity : Nat) : Nat := natBinarySocialWelfare b (dynamicProgrammingOptimalAllocation w b capacity)