KnapsackAuction.natFractionalGreedyList
defimported Lean
Fractional greedy prefix algorithm on a natural-number remaining capacity: take each whole item if it fits, and otherwise take exactly the remaining fraction of the current item and halt.
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 noncomputable def KnapsackAuction.natFractionalGreedyList (w : I → Nat) : List I → Nat → I → ℝ
- Defined in
- EconCSLib, `KnapsackAuction.natFractionalGreedyList`
- 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.natFractionalGreedyList← KnapsackAuction.natFractionalGreedyList (EconCSLib/MechanismDesign/Auction/Knapsack.lean:816): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- KnapsackAuction.dpSolveListA computable dynamic-programming solver for finite
0/1knapsack instances. The solver processes the agents in the given list order and… - 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.natFractionalGreedyList_le_integralGreedyList_plus_highestKnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highest
- KnapsackAuction.natFractionalGreedyAllocationThe ratio-sorted fractional greedy allocation on natural-number data.
- KnapsackAuction.natFractionalGreedyList_supportedOnKnapsackAuction.natFractionalGreedyList_supportedOn
- 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 /-- Fractional greedy prefix algorithm on a natural-number remaining capacity: take each whole item if it fits, and otherwise take exactly the remaining fraction of the current item and halt. -/ noncomputable def KnapsackAuction.natFractionalGreedyList (w : I → Nat) : List I → Nat → I → ℝ | [], _ => fun _ => 0 | i :: items, remaining => if _ : w i ≤ remaining then Function.update (natFractionalGreedyList w items (remaining - w i)) i 1 else fun j => if j = i then (remaining : ℝ) / w i else 0 termination_by items _ => items.length