KnapsackAuction.integralGreedyAllocation
defimported Lean
The ratio-sorted integral greedy allocation.
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.integralGreedyAllocation (w b : I → Nat) (capacity : Nat) : BinaryAllocation I
- Defined in
- EconCSLib, `KnapsackAuction.integralGreedyAllocation`
- 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.integralGreedyAllocation← KnapsackAuction.integralGreedyAllocation (EconCSLib/MechanismDesign/Auction/Knapsack.lean:789): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 7
- KnapsackAuction.sortedAgentsByRatioAgents sorted by decreasing value-to-weight ratio, with lexicographic tie-breaking via the ambient order on
I. - KnapsackAuction.integralGreedyListThe integral greedy prefix algorithm: process items in a fixed order, take each whole item if it fits, and halt when the first item fails…
- KnapsackAuction.BinaryAllocationA discrete knapsack allocation profile: each agent is either selected or not.
- 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.
- KnapsackAuction.sortedAgentsByRatioAgents sorted by decreasing value-to-weight ratio, with lexicographic tie-breaking via the ambient order on
- Used by 2
- KnapsackAuction.integralGreedyValueWelfare of the ratio-sorted integral 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 integral greedy allocation. -/ noncomputable def KnapsackAuction.integralGreedyAllocation (w b : I → Nat) (capacity : Nat) : BinaryAllocation I := integralGreedyList w ((natAuctionData w capacity).sortedAgentsByRatio (realBidOfNat b)) capacity