Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 5, p. 9 — every policy in the printed family is optimal and moves mass from x₂ to x₁

Proved
StrategicPolicy.NonMonotone.optimal_family

by mikedeng1 · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

best-responsegeneral-costsoptimal-policyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strategic-classification

Let π\piπ be a policy for the fixed three-value instance. If π(x1)=1\pi(x_1)=1π(x1​)=1, π(x2)≤0.7\pi(x_2)\leq0.7π(x2​)≤0.7, and π(x3)=1\pi(x_3)=1π(x3​)=1, then

u(π,0.1)≥u(ρ,0.1)for every admissible policy ρ,br⁡c,q,π(x2)=x1.u(\pi,0.1)\geq u(\rho,0.1)\quad\text{for every admissible policy }\rho, \qquad \operatorname{br}_{c,q,\pi}(x_2)=x_1.u(π,0.1)≥u(ρ,0.1)for every admissible policy ρ,brc,q,π​(x2​)=x1​.

Thus the entire family printed in Section 5 attains the optimal utility, and the mass initially at x2x_2x2​ is transported to x1x_1x1​.

Formalization Note The bound includes π(x2)=0.7\pi(x_2)=0.7π(x2​)=0.7. At this endpoint the individual at x2x_2x2​ is indifferent in benefit less cost between staying and moving to x1x_1x1​; the paper's highest-outcome tie rule selects x1x_1x1​.

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
  • Endorsed by Shuze Chen · Oct 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me