KnapsackAuction.capacity
abbrevimported Lean
The total capacity bound.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in variable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in abbrev KnapsackAuction.capacity (A : KnapsackAuction I U) : U
- Defined in
- EconCSLib, `KnapsackAuction.capacity`
- 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.capacity← KnapsackAuction.capacity (EconCSLib/MechanismDesign/Auction/Knapsack.lean:104): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,…
- KnapsackAuctionA knapsack auction with public weights
- Used by 9
- KnapsackAuction.dpSolveList_supportedOnKnapsackAuction.dpSolveList_supportedOn
- KnapsackAuction.dynamicProgrammingOptimalValueThe social welfare achieved by the dynamic-programming allocation.
- KnapsackAuction.dynamicProgrammingOptimalAllocationThe computable knapsack allocation obtained by running the dynamic program on the full finite agent list.
- KnapsackAuction.natFractionalGreedyValueWelfare of the ratio-sorted fractional greedy allocation.
- KnapsackAuction.dpSolveListA computable dynamic-programming solver for finite
0/1knapsack instances. The solver processes the agents in the given list order and… - KnapsackAuction.integralGreedyAllocationThe ratio-sorted integral greedy allocation.
- KnapsackAuction.integralGreedyValueWelfare of the ratio-sorted integral greedy allocation.
- KnapsackAuction.natFractionalGreedyAllocationThe ratio-sorted fractional greedy allocation on natural-number data.
- 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*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in /-- The total capacity bound. -/ abbrev KnapsackAuction.capacity (A : KnapsackAuction I U) : U := A.totalCapacity