KnapsackAuction.welfareMaximizingAllocationRule
defimported Lean
The welfare-maximizing allocation rule for the knapsack auction, obtained by choosing a feasible binary allocation with maximal social welfare and then viewing it as an I → ℝ allocation vector.
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.welfareMaximizingAllocationRule (A : KnapsackAuction I ℝ) (hW : 0 ≤ A.totalCapacity) : (I → ℝ) → I → ℝ
- Defined in
- EconCSLib, `KnapsackAuction.welfareMaximizingAllocationRule`
- 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.welfareMaximizingAllocationRule← KnapsackAuction.welfareMaximizingAllocationRule (EconCSLib/MechanismDesign/Auction/Knapsack.lean:241): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- KnapsackAuction.welfareMaximizerKnapsackAuction.welfareMaximizer
- KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - KnapsackAuction.binaryToAllocationThe
0/1allocation vector associated with a binary allocation profile.
- Used by 3
- KnapsackAuction.welfareMaximizingAllocationRule_isMonotoneKnapsackAuction.welfareMaximizingAllocationRule_isMonotone
- KnapsackAuction.welfareMaximizingPaymentRuleThe Myerson payment formula associated with the welfare-maximizing knapsack allocation rule.
- KnapsackAuction.welfareMaximizingMechanismThe canonical welfare-maximizing single-parameter knapsack mechanism, with payments given by the Myerson formula.
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 welfare-maximizing allocation rule for the knapsack auction, obtained by choosing a feasible binary allocation with maximal social welfare and then viewing it as an `I → ℝ` allocation vector. -/ noncomputable def KnapsackAuction.welfareMaximizingAllocationRule (A : KnapsackAuction I ℝ) (hW : 0 ≤ A.totalCapacity) : (I → ℝ) → I → ℝ := fun b => binaryToAllocation (A.welfareMaximizer b hW)