Proposition 5.4 -- weak monotonicity implies monotonicity with respect to any complete transitive order
ProvedMechanismDesign.IncentiveCompat.weaklyMonotone_monotoneWRTincentive-compatibilitymechanism-designp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1weak-monotonicity
Let be a complete and transitive order of the set of alternatives, and let be the induced partial order on types (Definition 5.6). If a decision rule is weakly monotone, then it is monotone with respect to :
The order is arbitrary; only the order on types changes with it.
Preamble
import Mathlib import Definitions.Def_MechanismDesign_IncentiveCompat_Model
Formal statement
namespace MechanismDesign.IncentiveCompat
/-- Proposition 5.4 (p.105): for a complete and transitive order `R` of `A`, a weakly monotone
decision rule is monotone with respect to `R`. -/
theorem weaklyMonotone_monotoneWRT {A Θ : Type*} [Nonempty Θ] (u : A → Θ → ℝ)
(R : A → A → Prop) (hR : IsCompleteTransitive R) (q : Θ → A) (hq : 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.105, Proposition 5.4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.