App. C.1, p. 40 — π_{m,m}(m) > π_{m,m−1}(m−1) if and only if Condition (5): λSL(m, m) > mµ(m, m)
ProvedTeleDriving.ScarceFleet.appC1_condition5_iffp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1ride-hailingservice-leveltele-driving
Under Assumptions 1–2 and the size restriction, the probability that all drivers are busy is larger with drivers than with drivers exactly when Condition (5) holds:
Condition (5) compares the average trip-completion rate with the completion rate when every vehicle is occupied. By the dichotomy of App. C.1 it decides which of the two shapes the service level has, which is how Theorem 1.A is proved.
Formalization Note is natural-number subtraction; the standing hypotheses force (Assumption 2 places a turning point strictly inside ). is the blocking probability of the system with vehicles and drivers.
Preamble
import Mathlib import Definitions.Def_TeleDriving_ScarceFleet_Model
Formal statement
namespace TeleDriving.ScarceFleet
theorem appC1_condition5_iff (mu : ℕ → ℝ → ℝ) (s lam : ℝ) (mbar m : ℕ) (hA1 : Assumption1 mu s)
(hA2 : Assumption2 mu mbar) (hsize : StandingSize mu s mbar m lam) :
piMN mu lam m m m > piMN mu lam m (m - 1) (m - 1) ↔
lam * SL mu lam m m > (m : ℝ) * mu m (m : ℝ) := by sorry
end TeleDriving.ScarceFleet
Source
Benjaafar, Wang & Yang, Human in The Loop Automation: Ride-Hailing with Remote (Tele-) Drivers, SSRN 4130757 (version of 1 June 2023), App. C.1, p. 40 (the display for SL(m, n+1) and the sentence after it)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.