AFTD Auto-Formalizing Theoretical Domains

spi_prophet_value

def

The prophet benchmark OPT = E[max_i X_i] for independent finite-support rewards.

Statement

open Finset in
noncomputable def spi_prophet_value {N K : ℕ} (x w : Fin (N + 1) → Fin K → ℝ) : ℝ
Defined in
Intrinsic Robustness of Prophet Inequality to Strategic Reward Signaling, NeurIPS 2024 (arXiv:2409.18269), Sec. 2-3 (model, Definition 2.4, Proposition 3.1), Remark 4.1 and Sec. 6; formalized by the operator (Claude), 2026-10-04, for finite reward supports and finite signal sets
Verified
03 Oct 2026
Axioms
none listed
Used by 2

Lean source view module on GitHub

open Finset in
/-- The prophet benchmark `OPT = E[max_i X_i]` for independent finite-support rewards. -/
noncomputable def spi_prophet_value {N K : ℕ} (x w : Fin (N + 1) → Fin K → ℝ) : ℝ :=
  ∑ k : Fin (N + 1) → Fin K, (∏ i, w i (k i)) * univ.sup' univ_nonempty (fun i => x i (k i))
See it in the graphDiscuss this resultChallenge it