KnapsackAuction.integralGreedyList
defimported Lean
The integral greedy prefix algorithm: process items in a fixed order, take each whole item if it fits, and halt when the first item fails to fit.
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] [LinearOrder I] [Nonempty I] in def KnapsackAuction.integralGreedyList (w : I → Nat) : List I → Nat → BinaryAllocation I
- Defined in
- EconCSLib, `KnapsackAuction.integralGreedyList`
- 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.integralGreedyList← KnapsackAuction.integralGreedyList (EconCSLib/MechanismDesign/Auction/Knapsack.lean:779): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- KnapsackAuction.dpSolveListA computable dynamic-programming solver for finite
0/1knapsack instances. The solver processes the agents in the given list order and… - KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,…
- KnapsackAuction.dpSolveListA computable dynamic-programming solver for finite
- Used by 4
- KnapsackAuction.integralGreedyList_supportedOnKnapsackAuction.integralGreedyList_supportedOn
- KnapsackAuction.integralGreedyAllocationThe ratio-sorted integral greedy allocation.
- KnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highestKnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highest
- 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 KnapsackAuction in open scoped BigOperators in variable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] in /-- The integral greedy prefix algorithm: process items in a fixed order, take each whole item if it fits, and halt when the first item fails to fit. -/ def KnapsackAuction.integralGreedyList (w : I → Nat) : List I → Nat → BinaryAllocation I | [], _ => fun _ => false | i :: items, remaining => if w i ≤ remaining then Function.update (integralGreedyList w items (remaining - w i)) i true else fun _ => false termination_by items _ => items.length