Section 5, p. 9 — every policy in the printed family is optimal and moves mass from x₂ to x₁
ProvedStrategicPolicy.NonMonotone.optimal_familybest-responsegeneral-costsoptimal-policyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strategic-classification
Let be a policy for the fixed three-value instance. If , , and , then
Thus the entire family printed in Section 5 attains the optimal utility, and the mass initially at is transported to .
Formalization Note The bound includes . At this endpoint the individual at is indifferent in benefit less cost between staying and moving to ; the paper's highest-outcome tie rule selects .
Preamble
import Mathlib import Definitions.Def_StrategicPolicy_NonMonotone_Setting import Definitions.Def_StrategicPolicy_NonMonotone_Example
Formal statement
namespace StrategicPolicy.NonMonotone
/-- Section 5, page 9: each policy in the printed family is optimal and moves the second mass to the first feature. -/
theorem optimal_family (π : Fin 3 → ℝ) (hπ : π ∈ StrategicPolicy.MonotoneBinary.Policies 3)
(h0 : π 0 = 1) (h1 : π 1 ≤ 7 / 10) (h2 : π 2 = 1) :
IsMaxOn (StrategicPolicy.MonotoneBinary.u p q γ c) (StrategicPolicy.MonotoneBinary.Policies 3) π ∧ br c q π 1 = 0 := by sorry
end StrategicPolicy.NonMonotone
Source
Tsirtsis et al., Optimal Decision Making Under Strategic Behavior, arXiv:1905.09239v5, p. 9, §5 example after the general-cost matrix
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.