KnapsackAuction.ratioTieKey
defimported Lean
Sorting key for the fractional greedy rule: higher ratio first, ties broken by the ambient linear 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.ratioTieKey (A : KnapsackAuction I U) (b : I → U) (i : I) : U × I
- Defined in
- EconCSLib, `KnapsackAuction.ratioTieKey`
- 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.ratioTieKey← KnapsackAuction.ratioTieKey (EconCSLib/MechanismDesign/Auction/Knapsack.lean:341): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - KnapsackAuction.ratioValue-to-weight ratio used by the fractional greedy rule.
- KnapsackAuctionA knapsack auction with public weights
- Used by 2
- KnapsackAuction.sortedAgentsByRatioAgents sorted by decreasing value-to-weight ratio, with lexicographic tie-breaking via the ambient order on
I. - KnapsackAuction.natFractionalGreedyValue_le_integralGreedyValue_plus_highestKnapsackAuction.natFractionalGreedyValue_le_integralGreedyValue_plus_highest
- KnapsackAuction.sortedAgentsByRatioAgents sorted by decreasing value-to-weight ratio, with lexicographic tie-breaking via the ambient order on
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 /-- Sorting key for the fractional greedy rule: higher ratio first, ties broken by the ambient linear order on `I`. -/ noncomputable def KnapsackAuction.ratioTieKey (A : KnapsackAuction I U) (b : I → U) (i : I) : U × I := (-A.ratio b i, i)