KnapsackAuction.feasibleBinaryAllocations
defimported Lean
The finite list of binary allocations satisfying the knapsack constraint.
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.feasibleBinaryAllocations (A : KnapsackAuction I U) : List (BinaryAllocation I)
- Defined in
- EconCSLib, `KnapsackAuction.feasibleBinaryAllocations`
- 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.feasibleBinaryAllocations← KnapsackAuction.feasibleBinaryAllocations (EconCSLib/MechanismDesign/Auction/Knapsack.lean:144): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- KnapsackAuction.binaryRespectsCapacityCapacity feasibility for a binary allocation profile.
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- Used by 7
- KnapsackAuction.welfareMaximizerKnapsackAuction.welfareMaximizer
- KnapsackAuction.welfareMaximizer_geKnapsackAuction.welfareMaximizer_ge
- KnapsackAuction.welfareMaximizingAllocationRule_isMonotoneKnapsackAuction.welfareMaximizingAllocationRule_isMonotone
- KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocationsKnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations
- KnapsackAuction.welfareMaximizer_mem_feasibleBinaryAllocationsKnapsackAuction.welfareMaximizer_mem_feasibleBinaryAllocations
- KnapsackAuction.feasibleBinaryAllocations_nonemptyKnapsackAuction.feasibleBinaryAllocations_nonempty
- KnapsackAuction.exists_welfareMaximizerA welfare-maximizing feasible binary allocation, chosen using
List.argMaxOnon the finite space of feasible0/1allocations.
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 finite list of binary allocations satisfying the knapsack constraint. -/ noncomputable def KnapsackAuction.feasibleBinaryAllocations (A : KnapsackAuction I U) : List (BinaryAllocation I) := by classical exact ((Finset.univ : Finset (BinaryAllocation I)).filter fun x => A.binaryRespectsCapacity x).toList