Proposition 7, p. 13 — demand bounding: under any state-dependent policy the steady-state flow f_ij,m(q) is at most φ_ij
ProvedSharedVehicleApprox.Pricing.prop_7p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricingshared-vehicle-systems
Consider the -unit system with arrival rates , a state-dependent quantile policy (quantiles , zero when ) and any stationary law of it. Then for all nodes the steady-state flow (3) satisfies the demand bounding property
Together with supply circulation (Proposition 8) this defines the flow polytope behind the elevated flow relaxation of Algorithm 1.
Differences from the source:
- encoding: π is the steady-state distribution of the policy, treated as unique (p. 7) → π is any probability vector on S_{n,m}, zero off S_{n,m}, satisfying the balance equation (1) at every state; reason: p. 7: "our upper bounds are all with respect to the best-possible steady-state distribution"; (1) is the paper's characterization of stationarity, and Mathlib has no continuous-time Markov chains
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_Networks_ClosedJackson import Definitions.Def_SharedVehicleApprox_Pricing_Model open Finset QueueingFundamentals.Networks Filter Topology
Formal statement
namespace SharedVehicleApprox.Pricing
/-- Proposition 7 (demand bounding), p. 13: under any state-dependent policy `q` and any
stationary law `π` of it, the steady-state flow satisfies `f_ij,m(q) ≤ φ_ij`. -/
theorem prop_7 {n m : ℕ} (φ : Fin n → Fin n → ℝ) (hφ : ∀ i j, 0 ≤ φ i j)
(q : (Fin n → ℕ) → Fin n → Fin n → ℝ) (π : (Fin n → ℕ) → ℝ)
(hq : IsPolicy n m q) (hπ : IsStationary n m φ q π) (i j : Fin n) :
flow n m φ q π i j ≤ φ i j := by sorry
end SharedVehicleApprox.Pricing
Source
Banerjee, Freund & Lykouris, Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework, arXiv:1608.06819v4, p. 13 (PDF 14), Proposition 7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.