AFTD Auto-Formalizing Theoretical Domains

spi_accepted

def

The signals of player i on which the static-threshold searcher with threshold T stops: those with posterior mean at least T.

Statement

open Finset in
noncomputable def spi_accepted {N K S : ℕ} (x w : Fin N → Fin K → ℝ) (φ : Fin N → Fin K → Fin S → ℝ)
    (T : ℝ) (i : Fin N) : Finset (Fin S)
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
Built on 2
  • spi_signal_massProbability of signal s of player i in the prophet search game with strategic reward signaling: sum over support points k of w_ik phi_ik(s).
  • spi_signal_valueReward-weighted probability of signal s of player i: probability of s times the searcher's posterior mean reward given s.
Used by 4
  • spi_accept_congrAcceptance probability and accepted value of player i depend only on player i's own scheme.
  • spi_accept_valueExpected reward collected from player i on the event that it is reached and accepted.
  • spi_accept_probProbability that the searcher accepts player i when she reaches it.
  • spi_accept_reductionThe acceptance probability, accepted value and posterior-mean constraint of any scheme depend only on accepted masses A_k in [0, w_ik]…

Lean source view module on GitHub

open Finset in
/-- The signals of player `i` on which the static-threshold searcher with threshold `T` stops: those whose posterior mean reward is at least `T` (written `T * mass ≤ value`, so null signals are harmless). -/
noncomputable def spi_accepted {N K S : ℕ} (x w : Fin N → Fin K → ℝ) (φ : Fin N → Fin K → Fin S → ℝ)
    (T : ℝ) (i : Fin N) : Finset (Fin S) :=
  univ.filter fun s => T * spi_signal_mass w φ i s ≤ spi_signal_value x w φ i s
See it in the graphDiscuss this resultChallenge it