KnapsackAuction.natFractionalGreedyAllocation
defimported Lean
The ratio-sorted fractional greedy allocation on natural-number data.
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.natFractionalGreedyAllocation (w b : I → Nat) (capacity : Nat) : I → ℝ
- Defined in
- EconCSLib, `KnapsackAuction.natFractionalGreedyAllocation`
- 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.natFractionalGreedyAllocation← KnapsackAuction.natFractionalGreedyAllocation (EconCSLib/MechanismDesign/Auction/Knapsack.lean:826): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 6
- KnapsackAuction.natFractionalGreedyListFractional greedy prefix algorithm on a natural-number remaining capacity: take each whole item if it fits, and otherwise take exactly the…
- KnapsackAuction.sortedAgentsByRatioAgents sorted by decreasing value-to-weight ratio, with lexicographic tie-breaking via the ambient order on
I. - KnapsackAuction.natAuctionDataThe knapsack-auction data obtained from natural-number weights and capacity, with dummy zero allocation/payment rules. This is only used…
- KnapsackAuction.realBidOfNatNatural-number bids viewed as real-valued bids.
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - KnapsackAuction.capacityThe total capacity bound.
- Used by 2
- KnapsackAuction.natFractionalGreedyValueWelfare of the ratio-sorted fractional greedy allocation.
- 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 ratio-sorted fractional greedy allocation on natural-number data. -/ noncomputable def KnapsackAuction.natFractionalGreedyAllocation (w b : I → Nat) (capacity : Nat) : I → ℝ := natFractionalGreedyList w ((natAuctionData w capacity).sortedAgentsByRatio (realBidOfNat b)) capacity