spi_two_point_max_value
def
The searcher's expected reward from a two-point player using an optimal scheme (E[X] if T <= E[X], T times the pooling probability if E[X] < T <= h, 0 above h).
Statement
noncomputable def spi_two_point_max_value (h l q T : ℝ) : ℝ
- 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_coreReal-arithmetic core of Proposition 3.1 for two-point rewards: accepted masses with posterior mean at least T have total at most…
- spi_two_point_aboveAbove its high value (T > h) a two-point player is never accepted, whatever its scheme.
- spx_payoff_midFor 24/5 < T <= 9, every equilibrium of the four-player instance gives the searcher T p1 + (1-p1)(10/3 + (1-p2) 8/5) with p1 =…
- spx_searcher_payoff_leIn the four-player instance, for every static threshold T, every S >= 2 and every equilibrium, the searcher's expected payoff is at most…
- 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_two_point_max_lowIf T <= E[X], a two-point player's optimal acceptance probability is 1 and its contribution is E[X].
- spi_two_point_equilibrium_pinnedIn every equilibrium of a two-point instance, every player reached with positive probability is accepted with probability…
- spi_two_point_max_midIf E[X] < T <= h, a two-point player's optimal acceptance probability is q(h-l)/(T-l), at posterior mean exactly T.
Lean source view module on GitHub
/-- The searcher's expected reward from a two-point player using an optimal scheme (no information if `T ≤ E[X]`, pooling the top mass to posterior mean exactly `T` otherwise). -/ noncomputable def spi_two_point_max_value (h l q T : ℝ) : ℝ := if T ≤ q * h + (1 - q) * l then q * h + (1 - q) * l else if T ≤ h then T * (q * (h - l) / (T - l)) else 0