AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
none listed
Used by 34

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
See it in the graphDiscuss this resultChallenge it