App. D.1, p. 44 — with m_λ = ⌊αλs⌋, ρ(k) > 1/α for 1 ≤ k ≤ m_λ
ProvedTeleDriving.AsymLimited.appD1_rho_gtloss-systemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ride-hailingtele-driving
Let be the expected trip time, , and let the service rate be (4), , so that the load is (display (13)). For every arrival rate , with vehicles,
In the supply-limited regime , the load exceeds uniformly over all occupancy levels; this geometric lower bound drives the comparison probability (19) and the vanishing of the low-occupancy mass in the proof of Theorem 2.A.
Formalization Note The statement holds for every , not only eventually. When the range of is empty.
Preamble
import Mathlib import Definitions.Def_TeleDriving_ScarceFleet_Model
Formal statement
namespace TeleDriving.AsymLimited
theorem appD1_rho_gt (s alpha : ℝ) (hs : 0 < s) (ha0 : 0 < alpha) (ha1 : alpha < 1) :
∀ lam : ℝ, 0 < lam → ∀ k : ℕ, k ∈ Finset.Icc 1 (TeleDriving.ScarceFleet.mLam alpha s lam) →
1 / alpha < TeleDriving.ScarceFleet.rho (TeleDriving.ScarceFleet.muBesbes s) lam (TeleDriving.ScarceFleet.mLam alpha s lam) (k : ℝ) := by sorry
end TeleDriving.AsymLimited
Source
Benjaafar, Wang & Yang, Human in The Loop Automation: Ride-Hailing with Remote (Tele-) Drivers, SSRN 4130757 (version of 1 June 2023), App. D.1, p. 44 (using (13), p. 42)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.