Proposition 5.5 -- on one-dimensional type spaces, weak monotonicity iff monotonicity with respect to R
ProvedMechanismDesign.IncentiveCompat.oneDimensional_weaklyMonotone_iffincentive-compatibilitymechanism-designone-dimensionalp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1
Let be a complete and transitive order of such that the type set is one-dimensional with respect to : any two distinct types satisfy or . Then a decision rule is weakly monotone if and only if it is monotone with respect to , that is,
On one-dimensional domains weak monotonicity thus reduces to the familiar requirement that higher types receive higher alternatives.
Preamble
import Mathlib import Definitions.Def_MechanismDesign_IncentiveCompat_Model
Formal statement
namespace MechanismDesign.IncentiveCompat
/-- Proposition 5.5 (p.106): if `Θ` is one-dimensional with respect to a complete and transitive
order `R` of `A`, a decision rule is weakly monotone if and only if it is monotone with respect
to `R`. -/
theorem oneDimensional_weaklyMonotone_iff {A Θ : Type*} [Nonempty Θ] (u : A → Θ → ℝ)
(R : A → A → Prop) (hR : IsCompleteTransitive R) (h1 : OneDimensional u R) (q : Θ → A) :
WeaklyMonotone u q ↔ MonotoneWRT u R q := by sorry
end MechanismDesign.IncentiveCompat
Source
Börgers, An Introduction to the Theory of Mechanism Design, Oxford University Press 2015, DOI 10.1093/acprof:oso/9780199734023.001.0001, p.106, Proposition 5.5
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.