KnapsackAuction.sortedAgentsByRatio
defimported Lean
Agents sorted by decreasing value-to-weight ratio, with lexicographic tie-breaking via the ambient order on I.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open KnapsackAuction 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.sortedAgentsByRatio (A : KnapsackAuction I U) (b : I → U) : List I
- Defined in
- EconCSLib, `KnapsackAuction.sortedAgentsByRatio`
- 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.sortedAgentsByRatio← KnapsackAuction.sortedAgentsByRatio (EconCSLib/MechanismDesign/Auction/Knapsack.lean:346): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- KnapsackAuction.ratioTieKeySorting key for the fractional greedy rule: higher ratio first, ties broken by the ambient linear order on
I. - 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.
- KnapsackAuction.ratioTieKeySorting key for the fractional greedy rule: higher ratio first, ties broken by the ambient linear order on
- Used by 4
- KnapsackAuction.fractionalGreedyAllocationThe greedy fractional knapsack allocation obtained by sorting agents by value-to-weight ratio and then filling capacity in that order.
- KnapsackAuction.integralGreedyAllocationThe ratio-sorted integral greedy allocation.
- KnapsackAuction.natFractionalGreedyAllocationThe ratio-sorted fractional greedy allocation on natural-number data.
- 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*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in variable [Fintype I] [DecidableEq I] [LinearOrder I] in /-- Agents sorted by decreasing value-to-weight ratio, with lexicographic tie-breaking via the ambient order on `I`. -/ noncomputable def KnapsackAuction.sortedAgentsByRatio (A : KnapsackAuction I U) (b : I → U) : List I := by classical exact ((Finset.univ : Finset I).toList).mergeSort (fun i j => decide (A.ratioTieKey b i ≤ A.ratioTieKey b j))