BayesianMechanism
structureimported Lean
A mechanism in an incomplete-information environment. T i is agent i's true type space, M i is agent i's message space, and prior is the common prior over type profiles. This keeps the Harsanyi-style uncertainty separate from the mechanism map itself: the mechanism acts on reported messages, while the prior lives as extra Bayesian structure.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in structure BayesianMechanism (I : Type*) (T : I → Type*) [∀ i, MeasurableSpace (T i)] (M : I → Type*) (O : Type*)
- Defined in
- EconCSLib, `BayesianMechanism`
- 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.BayesianMechanism← BayesianMechanism (EconCSLib/MechanismDesign/Auction/MechBayesian.lean:57): verbatimattribute [instance] BayesianMechanism.prob_prior← attribute [instance] BayesianMechanism.prob_prior (EconCSLib/MechanismDesign/Auction/MechBayesian.lean:69): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 3
- BayesianMechanismWithTransfers.toBayesianMechanismForget the transfer decomposition and recover the corresponding Bayesian mechanism with outcome space
A × (I → P). - DirectBayesianMechanismA direct-revelation Bayesian mechanism: agents report in their own type spaces.
- BayesianMechanism.toMechanismForget the prior and view a Bayesian mechanism simply as a mechanism on reported messages.
- BayesianMechanismWithTransfers.toBayesianMechanismForget the transfer decomposition and recover the corresponding Bayesian mechanism with outcome space
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- A mechanism in an incomplete-information environment. `T i` is agent `i`'s true type space, `M i` is agent `i`'s message space, and `prior` is the common prior over type profiles. This keeps the Harsanyi-style uncertainty separate from the mechanism map itself: the mechanism acts on reported messages, while the prior lives as extra Bayesian structure. -/ structure BayesianMechanism (I : Type*) (T : I → Type*) [∀ i, MeasurableSpace (T i)] (M : I → Type*) (O : Type*) where /-- Common prior probability measure over true type profiles. -/ prior : MeasureTheory.Measure (∀ i, T i) /-- The prior is a probability measure. -/ prob_prior : MeasureTheory.IsProbabilityMeasure prior /-- Outcome rule as a function of reported messages. -/ outcome : (∀ i, M i) → O -- Intentionally global so measure-theoretic lemmas can infer the probability -- structure from a mechanism term without repeated local `haveI := B.prob_prior`. attribute [instance] BayesianMechanism.prob_prior