KnapsackAuction.BinaryAllocation
abbrevimported Lean
A discrete knapsack allocation profile: each agent is either selected or not.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in variable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in variable [Fintype I] [DecidableEq I] in abbrev KnapsackAuction.BinaryAllocation (I : Type*)
- Defined in
- EconCSLib, `KnapsackAuction.BinaryAllocation`
- 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.BinaryAllocation← KnapsackAuction.BinaryAllocation (EconCSLib/MechanismDesign/Auction/Knapsack.lean:129): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 34
- KnapsackAuction.supportedOn_tail_of_eq_falseKnapsackAuction.supportedOn_tail_of_eq_false
- KnapsackAuction.dpSolveList_supportedOnKnapsackAuction.dpSolveList_supportedOn
- KnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacityKnapsackAuction.binaryToAllocation_fractionalFeasible_of_binaryRespectsCapacity
- KnapsackAuction.natBinaryLoad_update_true_of_falseKnapsackAuction.natBinaryLoad_update_true_of_false
- KnapsackAuction.fractionalSocialWelfare_realBidOfNat_binaryToAllocationKnapsackAuction.fractionalSocialWelfare_realBidOfNat_binaryToAllocation
- KnapsackAuction.feasibleBinaryAllocationsThe finite list of binary allocations satisfying the knapsack constraint.
- KnapsackAuction.welfareMaximizerKnapsackAuction.welfareMaximizer
- KnapsackAuction.supportedOnAn allocation is supported on a list of agents if every selected agent appears in that list.
- KnapsackAuction.natBinarySocialWelfare_update_true_of_falseKnapsackAuction.natBinarySocialWelfare_update_true_of_false
- KnapsackAuction.binaryRespectsCapacityCapacity feasibility for a binary allocation profile.
- KnapsackAuction.supportedOn_update_falseKnapsackAuction.supportedOn_update_false
- KnapsackAuction.welfareMaximizer_geKnapsackAuction.welfareMaximizer_ge
- KnapsackAuction.binaryLoadThe weighted load induced by a binary allocation profile.
- KnapsackAuction.binarySocialWelfare_updateKnapsackAuction.binarySocialWelfare_update
- KnapsackAuction.eq_false_of_supportedOn_of_not_memKnapsackAuction.eq_false_of_supportedOn_of_not_mem
- KnapsackAuction.natBinarySocialWelfare_eq_add_of_trueKnapsackAuction.natBinarySocialWelfare_eq_add_of_true
- KnapsackAuction.dynamicProgrammingOptimalAllocationThe computable knapsack allocation obtained by running the dynamic program on the full finite agent list.
- KnapsackAuction.welfareMaximizingAllocationRule_isMonotoneKnapsackAuction.welfareMaximizingAllocationRule_isMonotone
- KnapsackAuction.binaryToAllocationThe
0/1allocation vector associated with a binary allocation profile. - KnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocationsKnapsackAuction.BinaryRespectsCapacity_of_mem_feasibleBinaryAllocations
- KnapsackAuction.integralGreedyList_supportedOnKnapsackAuction.integralGreedyList_supportedOn
- KnapsackAuction.fractionalGreedyWelfare_ge_zeroOneWelfare_of_optimalIf the ratio-sorted greedy fractional allocation is optimal for the fractional relaxation, then its welfare dominates the welfare of the…
- KnapsackAuction.dpSolveListA computable dynamic-programming solver for finite
0/1knapsack instances. The solver processes the agents in the given list order and… - KnapsackAuction.welfareMaximizer_mem_feasibleBinaryAllocationsKnapsackAuction.welfareMaximizer_mem_feasibleBinaryAllocations
- KnapsackAuction.integralGreedyAllocationThe ratio-sorted integral greedy allocation.
- KnapsackAuction.natBinarySocialWelfareInteger-valued welfare of a binary allocation profile.
- KnapsackAuction.binarySocialWelfareSocial welfare of a binary allocation profile at valuation profile
b. - KnapsackAuction.feasibleBinaryAllocations_nonemptyKnapsackAuction.feasibleBinaryAllocations_nonempty
- KnapsackAuction.natBinaryLoad_eq_add_of_trueKnapsackAuction.natBinaryLoad_eq_add_of_true
- KnapsackAuction.natBinaryLoadInteger-valued load of a binary allocation profile.
- KnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highestKnapsackAuction.natFractionalGreedyList_le_integralGreedyList_plus_highest
- KnapsackAuction.integralGreedyListThe integral greedy prefix algorithm: process items in a fixed order, take each whole item if it fits, and halt when the first item fails…
- KnapsackAuction.supportedOn_nil_iffKnapsackAuction.supportedOn_nil_iff
- KnapsackAuction.exists_welfareMaximizerA welfare-maximizing feasible binary allocation, chosen using
List.argMaxOnon the finite space of feasible0/1allocations.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open scoped BigOperators in variable {I : Type*} {U : Type*} [Field U] [LinearOrder U] [IsStrictOrderedRing U] in variable [Fintype I] [DecidableEq I] in /-- A discrete knapsack allocation profile: each agent is either selected or not. -/ abbrev KnapsackAuction.BinaryAllocation (I : Type*) := I → Bool