Proof of Theorem 1, p. 7 (Appendix, p. 23) — balanced flows give equal availability at every location
ProvedVehicleSharePricing.Static.equal_availabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1product-formqueueing-networksvehicle-sharing
Let be a quantile policy ( on ) with balanced flows, for every location , which induces a strongly connected network, and let be a positive solution of the traffic equations (9). Then for every number of vehicles the product-form availability is the same at all locations:
The common value is the paper's (or ). It is what lets the reward rate of (3) factor as .
Formalization Note The paper asserts this for the optimal static policy , and its Appendix proves it "when the network is balanced"; the statement is posed for every balanced quantile policy inducing a strongly connected network, which includes .
Preamble
import Mathlib import Definitions.Def_VehicleSharePricing_Static_Model import Definitions.Def_VehicleSharePricing_Static_Availability
Formal statement
namespace VehicleSharePricing.Static
/-- Proof of Theorem 1, p. 7, proved in the Appendix, p. 23: under a quantile policy `q` with
balanced flows that induces a strongly connected network, the availability `α_i` with `K`
vehicles is the same at every location. -/
theorem equal_availability {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 : ℕ) (i j : L) :
availability P q r K i = availability P q r K j := by sorry
end VehicleSharePricing.Static
Source
Benjaafar & Shen, Pricing in On-Demand (and One-Way) Vehicle Sharing Networks, SSRN abstract 3998297 (version of 2023-01-10), p. 7, proof of Theorem 1; p. 23, Appendix, "Proof for α_i = α_j = α when the network is balanced"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.