MechanismWithTransfers.isExPostIR
defimported Lean
Ex-post individual rationality for a mechanism with transfers, relative to an externally supplied utility rule.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I : Type*} [DecidableEq I] {T : I → Type*} {A P V U : Type*} in variable (M : MechanismWithTransfers I T A P) in def MechanismWithTransfers.isExPostIR [Preorder U] [Zero U] (u : A → (I → P) → (∀ i, T i) → I → U) : Prop
- Defined in
- EconCSLib, `MechanismWithTransfers.isExPostIR`
- 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.MechanismWithTransfers.isExPostIR← MechanismWithTransfers.isExPostIR (EconCSLib/MechanismDesign/Auction/Transfer.lean:121): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- MechanismWithTransfersA mechanism with monetary transfers. -
I— agents -T— report/type space of each agent -A— allocation space -P— payment space…
- MechanismWithTransfersA mechanism with monetary transfers. -
- Used by 2
- MechanismWithTransfers.isQuasiLinearExPostIREx-post IR for quasi-linear utility, as a specialization of
isExPostIR. - MultipleParameterMechanism.VCGMechanism_isExPostIR_of_all_nonnegativeVCG satisfies the
MechanismWithTransfers.isExPostIRpredicate under the ambient assumption that every valuation in the unrestricted type…
- MechanismWithTransfers.isQuasiLinearExPostIREx-post IR for quasi-linear utility, as a specialization of
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I : Type*} [DecidableEq I] {T : I → Type*} {A P V U : Type*} in variable (M : MechanismWithTransfers I T A P) in /-- Ex-post individual rationality for a mechanism with transfers, relative to an externally supplied utility rule. -/ def MechanismWithTransfers.isExPostIR [Preorder U] [Zero U] (u : A → (I → P) → (∀ i, T i) → I → U) : Prop := ∀ trueTypes : (∀ i, T i), ∀ i : I, ∀ r : (∀ i, T i), 0 ≤ u (M.allocationRule (Function.update r i (trueTypes i))) (M.paymentRule (Function.update r i (trueTypes i))) trueTypes i