Equation (5), p. 8 —
ProvedVehicleSharePricing.Static.eq_5Let be a quantile policy with balanced flows that induces a strongly connected network, let be a positive solution of the traffic equations (9), and write for the availability at a location with vehicles. Then for every ,
This recursion in the number of vehicles is the engine of Theorems 1 and 2: bounding from below bounds from below. The paper derives it from the random observer property (arrival theorem) and Little's law.
Formalization Note The availability is the product-form one of the definition file, with (no vehicle can be waiting). The statement holds at every location ; the paper's is location-free by the equal-availability milestone. It is posed for every balanced quantile policy inducing a strongly connected network, which includes .
import Mathlib import Definitions.Def_VehicleSharePricing_Static_Model import Definitions.Def_VehicleSharePricing_Static_Availability
namespace VehicleSharePricing.Static
/-- Equation (5), p. 8 (Appendix, pp. 23–24): under a quantile policy `q` with balanced flows
that induces a strongly connected network, for every `K ≥ 1` and every location `i`,
`α(K) = K / (K + N − 1 + (∑_{(i,j)∈𝒜} Λ_ij q_ij / μ_ij)(1 − α(K − 1)))`. -/
theorem eq_5 {L : Type*} [Fintype L] [DecidableEq L] [Nonempty L]
(P : Instance L) (q : L → L → ℝ) (hq : IsQuantile P q) (hbal : Balanced P q)
(hconn : InducesStronglyConnected P q) (r : L → ℝ) (hr : IsTrafficSolution P q r)
(K : ℕ) (hK : 1 ≤ K) (i : L) :
availability P q r K i =
(K : ℝ) / ((K : ℝ) + (Fintype.card L : ℝ) - 1 +
workload P q * (1 - availability P q r (K - 1) i)) := by sorry
end VehicleSharePricing.Static
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.