AFTD Auto-Formalizing Theoretical Domains

MechanismWithTransfers.quasiLinearUtility

defimported Lean

Quasi-linear utility induced by: - a valuation function on allocations - an embedding of payments into utility space - subtraction in the utility space This permits, for example: - V = U with identity payment embedding - valuation codomains and payment codomains that differ but both map into U.

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.quasiLinearUtility [Sub U]
    (val : A → (∀ i, T i) → I → V)
    (valueToUtility : V → U) (paymentToUtility : P → U)
    (r : ∀ i, T i) (trueTypes : ∀ i, T i) (i : I) : U
Defined in
EconCSLib, `MechanismWithTransfers.quasiLinearUtility`
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 1
  • MechanismWithTransfersA mechanism with monetary transfers. - I — agents - T — report/type space of each agent - A — allocation space - P — payment space…
Used by 5

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
/-- Quasi-linear utility induced by: - a valuation function on allocations - an embedding of payments into utility space - subtraction in the utility space This permits, for example: - `V = U` with identity payment embedding - valuation codomains and payment codomains that differ but both map into `U`. -/
def MechanismWithTransfers.quasiLinearUtility [Sub U]
    (val : A → (∀ i, T i) → I → V)
    (valueToUtility : V → U) (paymentToUtility : P → U)
    (r : ∀ i, T i) (trueTypes : ∀ i, T i) (i : I) : U :=
  valueToUtility (val (M.allocationRule r) trueTypes i) -
    paymentToUtility (M.paymentRule r i)
See it in the graphDiscuss this resultChallenge it