KnapsackAuction.fractionalGreedyList
defimported Lean
Greedy fractional allocation along a fixed list order. If the next item does not fully fit, the algorithm takes exactly the remaining fraction and halts.
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 variable [Fintype I] [DecidableEq I] [LinearOrder I] in noncomputable def KnapsackAuction.fractionalGreedyList (A : KnapsackAuction I U) (b : I → U) : List I → U → I → U
- Defined in
- EconCSLib, `KnapsackAuction.fractionalGreedyList`
- 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.fractionalGreedyList← KnapsackAuction.fractionalGreedyList (EconCSLib/MechanismDesign/Auction/Knapsack.lean:354): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- 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.
- KnapsackAuctionA knapsack auction with public weights
- Used by 1
- KnapsackAuction.fractionalGreedyAllocationThe greedy fractional knapsack allocation obtained by sorting agents by value-to-weight ratio and then filling capacity in that order.
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 variable [Fintype I] [DecidableEq I] [LinearOrder I] in /-- Greedy fractional allocation along a fixed list order. If the next item does not fully fit, the algorithm takes exactly the remaining fraction and halts. -/ noncomputable def KnapsackAuction.fractionalGreedyList (A : KnapsackAuction I U) (b : I → U) : List I → U → I → U | [], _ => fun _ => 0 | i :: items, remaining => if _ : remaining ≤ 0 then fun _ => 0 else if _ : A.weight i ≤ remaining then Function.update (fractionalGreedyList A b items (remaining - A.weight i)) i 1 else fun j => if j = i then remaining / A.weight i else 0 termination_by items _ => items.length