AFTD Auto-Formalizing Theoretical Domains

spi_signal_mass

def

Probability 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).

Statement

open Finset in
def spi_signal_mass {N K S : ℕ} (w : Fin N → Fin K → ℝ) (φ : Fin N → Fin K → Fin S → ℝ)
    (i : Fin N) (s : 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
Used by 5
  • spi_accept_congrAcceptance probability and accepted value of player i depend only on player i's own scheme.
  • spi_acceptedThe signals of player i on which the static-threshold searcher with threshold T stops: those with posterior mean at least T.
  • spi_two_point_scheme_specFor S >= 2 the two-point scheme is a valid scheme and a player using it is accepted with probability exactly spi_two_point_max_prob.
  • 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
/-- Probability of signal `s` of player `i` in the prophet search game with strategic reward signaling (arXiv:2409.18269): player `i`'s reward takes its `k`-th support value with probability `w i k`, and `φ i k s` is the probability that its scheme sends `s` given that value. -/
def spi_signal_mass {N K S : ℕ} (w : Fin N → Fin K → ℝ) (φ : Fin N → Fin K → Fin S → ℝ)
    (i : Fin N) (s : Fin S) : ℝ :=
  ∑ k, w i k * φ i k s
See it in the graphDiscuss this resultChallenge it