§4.2 — and have a unique crossing point
ProvedQueueSignal.unique_crossinggame-theoryp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1queueingsignaling-gamesstrategic-customers
Let , , , and fix a belief . Regard the effective arrival rates of (1) and of (3) as functions of the potential arrival rate . Then there is exactly one with
and moreover for , while for .
At this is the crossing point of Proposition 1: below it a server facing customers who hold the prior belief prefers to conceal its queue, above it to reveal it.
Formalization Note The crossing point is asserted to exist and be unique among positive ; it is not a parameter.
Differences from the source:
- generalization: the unique crossing point of λ^O(δ) and λ^U(δ) (at the prior δ) → the same for every belief d ∈ [0, 1]; reason: d = δ is the source's statement
- generalization: "unique crossing point" → existence and uniqueness of the crossing, plus λ^O < λ^U on (0, λ̂) and λ^O > λ^U on (λ̂, ∞); reason: the sign clauses are what "crossing" means and what p.549 uses ("the server prefers to conceal the queue if λ^U(δ) > λ^O(δ) and to reveal it otherwise"); dropping them gives the printed statement
- encoding: n(δ^R) = ⌊[δ^R V_H + (1 − δ^R)V_L]µ/θ⌋ − 1 used as a summation bound → computed in ℤ and converted with Int.toNat; reason: under V_L > θ/µ and a belief in [0, 1] it is ≥ 0, so the conversion changes no instance
Preamble
import Mathlib import Definitions.Def_QueueSignal_SignalingGame import Definitions.Def_QueueSignal_QueueModel
Formal statement
namespace QueueSignal
/-- **The unique crossing point `λ̂`** (Guo, Haviv, Luo, Wang, *Signaling Service Quality Through Queue Disclosure*, MSOM 25(2) (2023),
doi:10.1287/msom.2022.1170, §4.2, p.549, PDF p.8: "We denote the unique
crossing point of `λ^O(δ)` and `λ^U(δ)` as `λ̂`").
For every belief `d ∈ [0, 1]` (in particular the prior `δ`), the functions `λ ↦ λ^O(λ, d)` and
`λ ↦ λ^U(λ, d)` on `(0, ∞)` cross exactly once, at some `λ̂ > 0`; below `λ̂` concealing gives the
larger effective arrival rate (`λ^O < λ^U`), above it revealing does (`λ^O > λ^U`). -/
theorem unique_crossing (P : Params) (hP : P.Valid) (d : ℝ) (hd0 : 0 ≤ d) (hd1 : d ≤ 1) :
∃ lhat : ℝ, 0 < lhat ∧ lamO P lhat d = lamU P lhat d ∧
(∀ lam : ℝ, 0 < lam → lamO P lam d = lamU P lam d → lam = lhat) ∧
(∀ lam : ℝ, 0 < lam → lam < lhat → lamO P lam d < lamU P lam d) ∧
(∀ lam : ℝ, lhat < lam → lamU P lam d < lamO P lam d) := by sorry
end QueueSignal
Source
Guo, Haviv, Luo, Wang, Signaling Service Quality Through Queue Disclosure, MSOM 25(2) (2023), doi:10.1287/msom.2022.1170, §4.2, paragraph before Proposition 1, p.549
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.