AFTD Auto-Formalizing Theoretical Domains

CombinatorialAuction.IsFeasible

defimported Lean

Feasibility: each item is allocated to at most one agent.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
def CombinatorialAuction.IsFeasible {I : Type*} {k : ℕ} {V P : Type*}
    (M : CombinatorialAuction I k V P) : Prop
Defined in
EconCSLib, `CombinatorialAuction.IsFeasible`
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
Built on 6
  • CombinatorialAuctionA combinatorial auction with k distinct items. This is a multiple-parameter mechanism whose allocation space is the type of…
  • MultipleParameterMechanismA multiple-parameter mechanism with transfers. Here A is the type of feasible allocations and V is the codomain of valuations. Agent…
  • MultipleParameterMechanism.ValuationThe valuation/type space of an agent in a multiple-parameter mechanism.
  • CombinatorialAllocationA multi-item allocation assigns each agent a bundle of items.
  • MultiItemBundle.toFinsetView a named multi-item bundle as the underlying finite set of item indices.
  • MechanismWithTransfersA mechanism with monetary transfers. - I — agents - T — report/type space of each agent - A — allocation space - P — payment space…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- Feasibility: each item is allocated to at most one agent. -/
def CombinatorialAuction.IsFeasible {I : Type*} {k : ℕ} {V P : Type*}
    (M : CombinatorialAuction I k V P) : Prop :=
  ∀ (b : ∀ _ : I, MultipleParameterMechanism.Valuation (CombinatorialAllocation I k) V)
    (i j : I), i ≠ j →
    ∀ item : Fin k,
      item ∈ MultiItemBundle.toFinset (M.allocationRule b i) →
      item ∉ MultiItemBundle.toFinset (M.allocationRule b j)
See it in the graphDiscuss this resultChallenge it