AFTD Auto-Formalizing Theoretical Domains

KnapsackAuction.welfareMaximizingMechanism

defimported Lean

The canonical welfare-maximizing single-parameter knapsack mechanism, with payments given by the Myerson formula.

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] in
noncomputable def KnapsackAuction.welfareMaximizingMechanism
    (A : KnapsackAuction I ℝ) (hW : 0 ≤ A.totalCapacity) : SingleParameterMechanism I ℝ
Defined in
EconCSLib, `KnapsackAuction.welfareMaximizingMechanism`
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 5
  • KnapsackAuction.welfareMaximizingAllocationRuleThe welfare-maximizing allocation rule for the knapsack auction, obtained by choosing a feasible binary allocation with maximal social…
  • KnapsackAuction.welfareMaximizingPaymentRuleThe Myerson payment formula associated with the welfare-maximizing knapsack allocation rule.
  • KnapsackAuctionA knapsack auction with public weights w i and total capacity W. The underlying strategic object is a SingleParameterMechanism I U,…
  • SingleParameterMechanismA single-parameter mechanism. Each agent i has a single private type θ_i : R (their "value per unit"). The allocation gives each agent…
  • MechanismWithTransfersA mechanism with monetary transfers. - I — agents - T — report/type space of each agent - A — allocation space - P — payment space…

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] in
/-- The canonical welfare-maximizing single-parameter knapsack mechanism, with payments given by the Myerson formula. -/
noncomputable def KnapsackAuction.welfareMaximizingMechanism
    (A : KnapsackAuction I ℝ) (hW : 0 ≤ A.totalCapacity) : SingleParameterMechanism I ℝ where
  allocationRule := A.welfareMaximizingAllocationRule hW
  paymentRule := A.welfareMaximizingPaymentRule hW
See it in the graphDiscuss this resultChallenge it