KnapsackAuction.IsFeasible
defimported Lean
Feasibility for a knapsack auction: * each agent's allocation lies in [0,1] * the weighted allocation satisfies the total capacity bound
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 def KnapsackAuction.IsFeasible [Fintype I] (A : KnapsackAuction I U) : Prop
- Defined in
- EconCSLib, `KnapsackAuction.IsFeasible`
- 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.IsFeasible← KnapsackAuction.IsFeasible (EconCSLib/MechanismDesign/Auction/Knapsack.lean:96): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 5
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - SingleParameterMechanism.IsAllocFeasibleAllocation feasibility: each agent's allocation lies in
[0, 1]. RequiresZero R,One R, andLE R(e.g., any linearly ordered field). - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - KnapsackAuction.RespectsCapacityThe allocation rule respects the knapsack capacity constraint.
- KnapsackAuctionA knapsack auction with public weights
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 /-- Feasibility for a knapsack auction: * each agent's allocation lies in `[0,1]` * the weighted allocation satisfies the total capacity bound -/ def KnapsackAuction.IsFeasible [Fintype I] (A : KnapsackAuction I U) : Prop := A.IsAllocFeasible ∧ A.RespectsCapacity