KnapsackAuction.RespectsCapacity
defimported Lean
The allocation rule respects the knapsack capacity constraint.
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 def KnapsackAuction.RespectsCapacity [Fintype I] (A : KnapsackAuction I U) : Prop
- Defined in
- EconCSLib, `KnapsackAuction.RespectsCapacity`
- 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.RespectsCapacity← KnapsackAuction.RespectsCapacity (EconCSLib/MechanismDesign/Auction/Knapsack.lean:89): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- SingleParameterMechanismA single-parameter mechanism. Each agent
ihas a single private typeθ_i : R(their "value per unit"). The allocation gives each agent… - 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. - MechanismWithTransfersA mechanism with monetary transfers. -
I— agents -T— report/type space of each agent -A— allocation space -P— payment space…
- SingleParameterMechanismA single-parameter mechanism. Each agent
- Used by 1
- KnapsackAuction.IsFeasibleFeasibility for a knapsack auction: * each agent's allocation lies in
[0,1]* the weighted allocation satisfies the total capacity bound
- KnapsackAuction.IsFeasibleFeasibility for a knapsack auction: * each agent's allocation lies in
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 allocation rule respects the knapsack capacity constraint. -/ def KnapsackAuction.RespectsCapacity [Fintype I] (A : KnapsackAuction I U) : Prop := ∀ b : I → U, (∑ i, A.weight i * A.allocationRule b i) ≤ A.totalCapacity