Proposition 8.3 -- monotonicity implies set-monotonicity
ProvedMechanismDesign.SocialChoice.monotone_setMonotonemechanism-designp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1social-choice
Let be a direct mechanism on profiles of linear orders over a finite set of alternatives. If is monotone (Definition 8.4), then is set-monotone: whenever for some and, for every agent ,
then .
Set-monotonicity says that reshuffling agents' rankings inside a set cannot move the outcome out of ; it is used with throughout the proof of Proposition 8.5.
Preamble
import Mathlib import Definitions.Def_MechanismDesign_SocialChoice_Model
Formal statement
namespace MechanismDesign.SocialChoice
/-- **Proposition 8.3** (Börgers, p.145): if `f` is monotone, then `f` is set-monotone. -/
theorem monotone_setMonotone {ι A : Type*} [Fintype ι] [Fintype A]
(f : DirectMechanism ι A) (hf : IsMonotone f) : IsSetMonotone f := by sorry
end MechanismDesign.SocialChoice
Source
Börgers, An Introduction to the Theory of Mechanism Design, Oxford University Press 2015, DOI 10.1093/acprof:oso/9780199734023.001.0001, p.145, Proposition 8.3 (Definition 8.5)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.