KnapsackAuction.natAuctionData
defimported Lean
The knapsack-auction data obtained from natural-number weights and capacity, with dummy zero allocation/payment rules. This is only used to instantiate the fractional greedy construction.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in variable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] in def KnapsackAuction.natAuctionData (w : I → Nat) (capacity : Nat) : KnapsackAuction I ℝ
- Defined in
- EconCSLib, `KnapsackAuction.natAuctionData`
- 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.natAuctionData← KnapsackAuction.natAuctionData (EconCSLib/MechanismDesign/Auction/Knapsack.lean:767): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 3
- SingleParameterMechanismA single-parameter mechanism. Each agent
ihas a single private typeθ_i : R(their "value per unit"). The allocation gives each agent… - KnapsackAuctionA knapsack auction with public weights
w iand total capacityW. The underlying strategic object is aSingleParameterMechanism I U,… - MechanismWithTransfersA mechanism with monetary transfers. -
I— agents -T— report/type space of each agent -A— allocation space -P— payment space…
- SingleParameterMechanismA single-parameter mechanism. Each agent
- Used by 3
- KnapsackAuction.integralGreedyAllocationThe ratio-sorted integral greedy allocation.
- KnapsackAuction.natFractionalGreedyAllocationThe ratio-sorted fractional greedy allocation on natural-number data.
- KnapsackAuction.natFractionalGreedyValue_le_integralGreedyValue_plus_highestKnapsackAuction.natFractionalGreedyValue_le_integralGreedyValue_plus_highest
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in variable {I : Type*} [Fintype I] [DecidableEq I] [LinearOrder I] [Nonempty I] in /-- The knapsack-auction data obtained from natural-number weights and capacity, with dummy zero allocation/payment rules. This is only used to instantiate the fractional greedy construction. -/ def KnapsackAuction.natAuctionData (w : I → Nat) (capacity : Nat) : KnapsackAuction I ℝ where allocationRule := fun _ _ => 0 paymentRule := fun _ _ => 0 weight := fun i => (w i : ℝ) totalCapacity := capacity