KnapsackAuction.ratio
defimported Lean
Value-to-weight ratio used by the fractional greedy rule.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true 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.ratio (A : KnapsackAuction I U) (b : I → U) (i : I) : U
- Defined in
- EconCSLib, `KnapsackAuction.ratio`
- 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.ratio← KnapsackAuction.ratio (EconCSLib/MechanismDesign/Auction/Knapsack.lean:336): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,…
- KnapsackAuctionA knapsack auction with public weights
- Used by 1
- KnapsackAuction.ratioTieKeySorting key for the fractional greedy rule: higher ratio first, ties broken by the ambient linear order on
I.
- KnapsackAuction.ratioTieKeySorting key for the fractional greedy rule: higher ratio first, ties broken by the ambient linear order on
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true 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 /-- Value-to-weight ratio used by the fractional greedy rule. -/ noncomputable def KnapsackAuction.ratio (A : KnapsackAuction I U) (b : I → U) (i : I) : U := b i / A.weight i