AFTD Auto-Formalizing Theoretical Domains

spx_vals

lemmaverified

The support values and probabilities of the four-player instance, entry by entry.

Statement

lemma spx_vals :
    spx_x 0 0 = 24 / 5 ∧ spx_x 0 1 = 0 ∧ spx_w 0 0 = 1 ∧ spx_x 1 0 = 9 ∧ spx_x 1 1 = 3 ∧ spx_w 1 0 = 1 / 10 ∧
    spx_x 2 0 = 1000 ∧ spx_x 2 1 = 0 ∧ spx_w 2 0 = 1 / 300 ∧ spx_x 3 0 = 40 ∧ spx_x 3 1 = 0 ∧
    spx_w 3 0 = 1 / 25
Source
step towards strategic_prophet_no_half_robust_static_threshold (no static threshold is 1/2-robust, open in Intrinsic Robustness of Prophet Inequality to Strategic Reward Signaling, NeurIPS 2024 (arXiv:2409.18269), Remark 4.1 and Sec. 6)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • spx_xSupport values of the four-player instance: X0 = 24/5 surely; X1 in {9, 3}; X2 in {1000, 0}; X3 in {40, 0}.
  • spx_wProbabilities of the four-player instance: 1; 1/10 for 9; 1/300 for 1000; 1/25 for 40.
Used by 2
  • spx_payoff_midFor 24/5 < T <= 9, every equilibrium of the four-player instance gives the searcher T p1 + (1-p1)(10/3 + (1-p2) 8/5) with p1 =…
  • spx_searcher_payoff_leIn the four-player instance, for every static threshold T, every S >= 2 and every equilibrium, the searcher's expected payoff is at most…

Lean source view module on GitHub

/-- The support values and probabilities of the four-player instance. -/lemma spx_vals :    spx_x 0 0 = 24 / 5 ∧ spx_x 0 1 = 0 ∧ spx_w 0 0 = 1 ∧ spx_x 1 0 = 9 ∧ spx_x 1 1 = 3 ∧ spx_w 1 0 = 1 / 10 ∧    spx_x 2 0 = 1000 ∧ spx_x 2 1 = 0 ∧ spx_w 2 0 = 1 / 300 ∧ spx_x 3 0 = 40 ∧ spx_x 3 1 = 0 ∧    spx_w 3 0 = 1 / 25 := by  simp [spx_x, spx_w]
See it in the graphDiscuss this resultChallenge it