AFTD Auto-Formalizing Theoretical Domains

spi_player_payoff

def

Player i's payoff: the probability that the searcher selects it.

Statement

noncomputable def spi_player_payoff {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_accept_probProbability that the searcher accepts player i when she reaches it.
  • spi_reach_probProbability that the search reaches player i: all earlier players are rejected (independence across players).
Used by 3
  • spi_is_equilibriumNash equilibrium of the players' signaling game induced by a static threshold T: no player can raise its selection probability by…
  • 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_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

/-- Player `i`'s payoff: the probability that the searcher selects it. -/
noncomputable def spi_player_payoff {N K S : ℕ} (x w : Fin N → Fin K → ℝ) (φ : Fin N → Fin K → Fin S → ℝ)
    (T : ℝ) (i : Fin N) : ℝ :=
  spi_reach_prob x w φ T i * spi_accept_prob x w φ T i
See it in the graphDiscuss this resultChallenge it