KnapsackAuction.realBidOfNat
defimported Lean
Natural-number bids viewed as real-valued bids.
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.realBidOfNat (b : I → Nat) : I → ℝ
- Defined in
- EconCSLib, `KnapsackAuction.realBidOfNat`
- 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.realBidOfNat← KnapsackAuction.realBidOfNat (EconCSLib/MechanismDesign/Auction/Knapsack.lean:774): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 6
- KnapsackAuction.fractionalSocialWelfare_realBidOfNat_binaryToAllocationKnapsackAuction.fractionalSocialWelfare_realBidOfNat_binaryToAllocation
- KnapsackAuction.natFractionalGreedyValueWelfare of the ratio-sorted fractional greedy allocation.
- KnapsackAuction.integralGreedyAllocationThe ratio-sorted integral greedy allocation.
- KnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highestKnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highest
- 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 /-- Natural-number bids viewed as real-valued bids. -/ def KnapsackAuction.realBidOfNat (b : I → Nat) : I → ℝ := fun i => (b i : ℝ)