AFTD Auto-Formalizing Theoretical Domains

spi_is_scheme

def

A signaling scheme of one player: for every support point a probability distribution over the S signals.

Statement

open Finset in
def spi_is_scheme {K S : ℕ} (ψ : Fin K → Fin S → ℝ) : Prop
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 8
  • spi_two_point_aboveAbove its high value (T > h) a two-point player is never accepted, whatever its scheme.
  • 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_reach_prob_nonnegReach probabilities are nonnegative in a two-point instance under valid schemes.
  • spi_is_equilibriumNash equilibrium of the players' signaling game induced by a static threshold T: no player can raise its selection probability by…
  • spi_accept_prob_mem_IccAcceptance probabilities of valid schemes on two-point rewards lie in [0, 1].
  • 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]…

Lean source view module on GitHub

open Finset in
/-- A signaling scheme of one player: for every support point, a probability distribution over the `S` signals. -/
def spi_is_scheme {K S : ℕ} (ψ : Fin K → Fin S → ℝ) : Prop :=
  (∀ k s, 0 ≤ ψ k s) ∧ ∀ k, ∑ s, ψ k s = 1
See it in the graphDiscuss this resultChallenge it