AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.fractionalGreedyAllocation

defimported Lean

The greedy fractional knapsack allocation obtained by sorting agents by value-to-weight ratio and then filling capacity in that order.

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.fractionalGreedyAllocation
    (A : KnapsackAuction I U) (b : I → U) : I → U
Defined in
EconCSLib, `KnapsackAuction.fractionalGreedyAllocation`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 3
  • KnapsackAuction.sortedAgentsByRatioAgents sorted by decreasing value-to-weight ratio, with lexicographic tie-breaking via the ambient order on I.
  • KnapsackAuctionA knapsack auction with public weights w i and total capacity W. The underlying strategic object is a SingleParameterMechanism I U,…
  • KnapsackAuction.fractionalGreedyListGreedy fractional allocation along a fixed list order. If the next item does not fully fit, the algorithm takes exactly the remaining…
Used by 1

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
/-- The greedy fractional knapsack allocation obtained by sorting agents by value-to-weight ratio and then filling capacity in that order. -/
noncomputable def KnapsackAuction.fractionalGreedyAllocation
    (A : KnapsackAuction I U) (b : I → U) : I → U :=
  A.fractionalGreedyList b (A.sortedAgentsByRatio b) A.totalCapacity
See it in the graphDiscuss this resultChallenge it