AFTD Auto-Formalizing Theoretical Domains

SingleParameterMechanism.IsMonotone

defimported Lean

Monotonicity of the allocation rule. Agent i's allocation is non-decreasing in i's reported type, holding all other reports fixed. This is Myerson's necessary and sufficient condition for DSIC in the single-parameter setting (with quasi-linear utility and the appropriate payment formula). [Myerson 1981; AGT Thm 9.36]

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {I : Type*} [DecidableEq I] {R : Type*} in
variable (M : SingleParameterMechanism I R) in
def SingleParameterMechanism.IsMonotone [Preorder R] : Prop
Defined in
EconCSLib, `SingleParameterMechanism.IsMonotone`
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 2
  • SingleParameterMechanismA single-parameter mechanism. Each agent i has a single private type θ_i : R (their "value per unit"). The allocation gives each agent…
  • MechanismWithTransfersA mechanism with monetary transfers. - I — agents - T — report/type space of each agent - A — allocation space - P — payment space…
Used by 8

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {I : Type*} [DecidableEq I] {R : Type*} in
variable (M : SingleParameterMechanism I R) in
/-- Monotonicity of the allocation rule. Agent `i`'s allocation is non-decreasing in `i`'s reported type, holding all other reports fixed. This is Myerson's necessary and sufficient condition for DSIC in the single-parameter setting (with quasi-linear utility and the appropriate payment formula). [Myerson 1981; AGT Thm 9.36] -/
def SingleParameterMechanism.IsMonotone [Preorder R] : Prop :=
  ∀ (i : I) (θ θ' : R), θ ≤ θ' →
    ∀ (b : I → R),
      M.allocationRule (Function.update b i θ) i ≤
      M.allocationRule (Function.update b i θ') i
See it in the graphDiscuss this resultChallenge it