AFTD Auto-Formalizing Theoretical Domains

CombinatorialAuction

structureimported Lean

A combinatorial auction with k distinct items. This is a multiple-parameter mechanism whose allocation space is the type of bundle-allocation profiles I → Finset (Fin k). Each agent reports a valuation over those allocation profiles.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
structure CombinatorialAuction (I : Type*) (k : ℕ) (V : Type*) (P : Type*)
    extends MultipleParameterMechanism I (CombinatorialAllocation I k) V P
Defined in
EconCSLib, `CombinatorialAuction`
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 3
  • MultipleParameterMechanismA multiple-parameter mechanism with transfers. Here A is the type of feasible allocations and V is the codomain of valuations. Agent…
  • CombinatorialAllocationA multi-item allocation assigns each agent a bundle of items.
  • MechanismWithTransfersA mechanism with monetary transfers. - I — agents - T — report/type space of each agent - A — allocation space - P — payment space…
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- A combinatorial auction with `k` distinct items. This is a multiple-parameter mechanism whose allocation space is the type of bundle-allocation profiles `I → Finset (Fin k)`. Each agent reports a valuation over those allocation profiles. -/
structure CombinatorialAuction (I : Type*) (k : ℕ) (V : Type*) (P : Type*)
    extends MultipleParameterMechanism I (CombinatorialAllocation I k) V P
See it in the graphDiscuss this resultChallenge it