spi_two_point_scheme
def
The optimal scheme of Proposition 3.1 for a two-point reward embedded in S signals: high value sends signal 0, low value sends signal 0 with the pooling probability and signal 1 otherwise.
Statement
noncomputable def spi_two_point_scheme (S : ℕ) (h l q T : ℝ) : Fin 2 → Fin S → ℝ
- Defined in
- Intrinsic Robustness of Prophet Inequality to Strategic Reward Signaling, NeurIPS 2024 (arXiv:2409.18269), Proposition 3.1 (threshold signaling scheme); two-point case embedded in S signals
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Built on 1
- spi_two_point_pool_probThe probability with which the low value joins the accepted signal in the optimal scheme: 1 if T <= E[X], q(h-T)/((1-q)(T-l)) if E[X] < T…
- Used by 2
- 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…
Lean source view module on GitHub
/-- The optimal scheme of Prop. 3.1 for a two-point reward, embedded in `S` signals: the high value (index 0) always sends signal 0; the low value (index 1) sends signal 0 with probability `spi_two_point_pool_prob` and signal 1 otherwise. -/ noncomputable def spi_two_point_scheme (S : ℕ) (h l q T : ℝ) : Fin 2 → Fin S → ℝ := fun k s => if k = 0 then (if s.val = 0 then 1 else 0) else if s.val = 0 then spi_two_point_pool_prob h l q T else if s.val = 1 then 1 - spi_two_point_pool_prob h l q T else 0