spi_accept_prob
def
Probability that the searcher accepts player i when she reaches it.
Statement
open Finset in noncomputable def spi_accept_prob {N K S : ℕ} (x w : Fin N → Fin K → ℝ) (φ : Fin N → Fin K → Fin S → ℝ) (T : ℝ) (i : Fin N) : ℝ
- 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_acceptedThe signals of player i on which the static-threshold searcher with threshold T stops: those with posterior mean at least T.
- Used by 11
- spi_two_point_aboveAbove its high value (T > h) a two-point player is never accepted, whatever its scheme.
- spi_accept_congrAcceptance probability and accepted value of player i depend only on player i's own scheme.
- spi_reach_prob_fin_fourFor four players the reach probabilities are 1, 1-P0, (1-P0)(1-P1) and (1-P0)(1-P1)(1-P2).
- spi_two_point_boundFor a two-point reward, every scheme's acceptance probability is at most spi_two_point_max_prob, and if it attains it the accepted value…
- spi_player_payoffPlayer i's payoff: the probability that the searcher selects it.
- spi_accept_prob_mem_IccAcceptance probabilities of valid schemes on two-point rewards lie in [0, 1].
- spi_reach_probProbability that the search reaches player i: all earlier players are rejected (independence across players).
- 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_two_point_equilibrium_existsExistence of equilibrium (Proposition 3.1 for two-point rewards): for every static threshold and S >= 2 signals, all players using the…
- 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]…
- spi_two_point_equilibrium_pinnedIn every equilibrium of a two-point instance, every player reached with positive probability is accepted with probability…
Lean source view module on GitHub
open Finset in /-- Probability that the searcher accepts player `i` when she reaches it. -/ noncomputable def spi_accept_prob {N K S : ℕ} (x w : Fin N → Fin K → ℝ) (φ : Fin N → Fin K → Fin S → ℝ) (T : ℝ) (i : Fin N) : ℝ := ∑ s ∈ spi_accepted x w φ T i, spi_signal_mass w φ i s