Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 5, p. 9 — no optimal policy in the three-value general-cost instance is outcome monotonic

Proved
StrategicPolicy.NonMonotone.no_outcome_monotonic_optimum

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

general-costsoptimal-policyoutcome-monotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strategic-classification

For the fixed three-value instance of Section 5, at least one admissible optimal policy exists, but every admissible policy maximizing the strategic utility fails outcome monotonicity:

(∃π∈[0,1]3: u(π,0.1)=max⁡ρ∈[0,1]3u(ρ,0.1))∧(∀π∈[0,1]3: u(π,0.1)=max⁡ρ∈[0,1]3u(ρ,0.1)⟹¬OMPolicy⁡(q,π)).\bigl(\exists\pi\in[0,1]^3:\ u(\pi,0.1)=\max_{\rho\in[0,1]^3}u(\rho,0.1)\bigr) \quad\land\quad \bigl(\forall\pi\in[0,1]^3:\ u(\pi,0.1)=\max_{\rho\in[0,1]^3}u(\rho,0.1) \Longrightarrow \neg\operatorname{OMPolicy}(q,\pi)\bigr).(∃π∈[0,1]3: u(π,0.1)=ρ∈[0,1]3max​u(ρ,0.1))∧(∀π∈[0,1]3: u(π,0.1)=ρ∈[0,1]3max​u(ρ,0.1)⟹¬OMPolicy(q,π)).

This gives the paper's counterexample to the existence of an outcome-monotonic optimum under general costs. The existence clause makes the counterexample substantive.

Formalization Note Outcome monotonicity uses the one-way reading of equation (1), π(xi)<π(xj)⇒q(xi)<q(xj)\pi(x_i)<\pi(x_j)\Rightarrow q(x_i)<q(x_j)π(xi​)<π(xj​)⇒q(xi​)<q(xj​). Consequently the negative conclusion is stronger than failure of the literal biconditional printed there. The maximum is taken over all real-valued policies in [0,1]3[0,1]^3[0,1]3, not a finite grid.

Preamble
import Mathlib
import Definitions.Def_StrategicPolicy_NonMonotone_Setting
import Definitions.Def_StrategicPolicy_NonMonotone_Example
Formal statement
namespace StrategicPolicy.NonMonotone

/-- Section 5, page 9: an optimum exists, and none obeys outcome monotonicity. -/
theorem no_outcome_monotonic_optimum :
    (∃ π : Fin 3 → ℝ, π ∈ StrategicPolicy.MonotoneBinary.Policies 3 ∧ IsMaxOn (StrategicPolicy.MonotoneBinary.u p q γ c) (StrategicPolicy.MonotoneBinary.Policies 3) π) ∧
    (∀ π : Fin 3 → ℝ, π ∈ StrategicPolicy.MonotoneBinary.Policies 3 → IsMaxOn (StrategicPolicy.MonotoneBinary.u p q γ c) (StrategicPolicy.MonotoneBinary.Policies 3) π →
      ¬ StrategicPolicy.MonotoneBinary.OMPolicy q π) := by sorry

end StrategicPolicy.NonMonotone
Source
Tsirtsis et al., Optimal Decision Making Under Strategic Behavior, arXiv:1905.09239v5, p. 9, §5 bold heading and general-cost example
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