Proof of Proposition 5, eqs. (54)–(55), p. 587 — ψ₁(x) > ψ₂(x) iff π(x) > β ln K/(λ₁ − λ₂)
ProvedBoundedNV.Stakes.eq54_55_single_crossingbounded-rationalitylogit-choicep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1single-crossing
Let have positive Lebesgue measure, let be a real function, and . For let , assume is integrable on , and let
be the logit density of on . Put . Then for every ,
This single-crossing property says the decision maker with the larger stake puts more weight exactly on the decisions whose payoff exceeds one threshold; it drives the stochastic dominance (56)–(57) and hence Proposition 5.
Formalization Note , positive measure of and integrability of on are implicit on the page; they make both normalisers finite and positive, so and is genuine.
Preamble
import Mathlib import Definitions.Def_BoundedNV_ExpFam_Logit
Formal statement
namespace BoundedNV.Stakes
open MeasureTheory
/-- Proof of Proposition 5, eqs. (54)–(55), p. 587: with `K` the ratio of the normalizers of the
logit densities `ψᵢ` of the utilities `uᵢ = λᵢ π` (`λ₁ > λ₂`, same `β`), for every `x ∈ S`,
`ψ₁(x) > ψ₂(x) ⇔ e^{(u₁(x) − u₂(x))/β} > K ⇔ π(x) > β ln K / (λ₁ − λ₂)`. -/
theorem eq54_55_single_crossing (S : Set ℝ) (hSpos : 0 < volume S)
(π : ℝ → ℝ) (β lam₁ lam₂ : ℝ) (hβ : 0 < β) (hlam : lam₂ < lam₁)
(hint₁ : IntegrableOn (fun x => Real.exp (lam₁ * π x / β)) S)
(hint₂ : IntegrableOn (fun x => Real.exp (lam₂ * π x / β)) S)
(x : ℝ) (hx : x ∈ S) :
let K := (∫ v in S, Real.exp (lam₁ * π v / β)) / (∫ v in S, Real.exp (lam₂ * π v / β))
(BoundedNV.Uniform.logitDensity S (fun y => lam₂ * π y) β x < BoundedNV.Uniform.logitDensity S (fun y => lam₁ * π y) β x ↔
K < Real.exp ((lam₁ * π x - lam₂ * π x) / β)) ∧
(K < Real.exp ((lam₁ * π x - lam₂ * π x) / β) ↔
β * Real.log K / (lam₁ - lam₂) < π x) := by sorry
end BoundedNV.Stakes
Source
Su, Bounded Rationality in Newsvendor Models, Manufacturing & Service Operations Management 10(4), 2008, p. 587 (PDF p. 22), proof of Proposition 5, eqs. (54)–(55)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.