Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Expected en route time to the nearest of mmm uniformly placed taxis: ∫0R/v((R−vt)/R)m dt=R/(v(m+1))\int_0^{R/v}((R-vt)/R)^m\,dt=R/(v(m+1))∫0R/v​((R−vt)/R)mdt=R/(v(m+1))

Proved
OnDemandRideHailing.CallNoCall.section_5_1_expected_en_route_time

by mikedeng1 · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

queueing-theoryride-hailingstate-dependent-queuetransportation

Let R>0R>0R>0 be the perimeter of the road and v>0v>0v>0 the taxis' speed. For every natural number mmm,

∫0R/v(R−vtR)mdt=Rv(m+1).\int_0^{R/v}\left(\frac{R-vt}{R}\right)^{m}dt=\frac{R}{v(m+1)} .∫0R/v​(RR−vt​)mdt=v(m+1)R​.

With m=k−nm=k-nm=k−n idle taxis placed uniformly on the road, ((R−vt)/R)k−n((R-vt)/R)^{k-n}((R−vt)/R)k−n is the probability that the en route time to the nearest one is at least ttt, and the identity gives the expected en route time R/(v(k−n+1))R/(v(k-n+1))R/(v(k−n+1)) of the call approximation (1). For other exponents the same identity turns the exponential-free parts of the no-call integrals (3) into the en route terms of (1).

Differences from the source:

  • generalization: the exponent k − n (k − n idle taxis, n < k) → every exponent m : ℕ; reason: the integral identity holds for every m and specializes to the printed case m = k − n
  • reading: §3's R the perimeter of the road and v the taxis' speed (pp. 7–8) → hypotheses 0 < R, 0 < v; reason: standing assumptions of the model; they exclude only parameter values that are not the model
Preamble
import Mathlib
Formal statement
namespace OnDemandRideHailing.CallNoCall

/-- **The expected en route time to the nearest of `m` uniformly placed taxis.**
Feng, Kong, Wang, *We Are on the Way: Analysis of On-Demand Ride-Hailing Systems*, SSRN 2960991, §5.1, unnumbered computation, p. 15:
`P(t(1c)_e ≥ t) = Π_{i=1}^{k−n} P(li/v ≥ t) = ((R − vt)/R)^{k−n}`, and thus the expected en route
time `t̄(1c)_e = E[t(1c)_e] = ∫_0^{R/v} P(t(1c)_e ≥ t) dt = R/(v(k−n+1))`.

For a road of perimeter `R > 0`, speed `v > 0` and every natural number `m`,
`∫_0^{R/v} ((R − vt)/R)^m dt = R/(v(m+1))`.

**Formalization Note.** Stated for every exponent `m`, not only `m = k − n`; the paper's case is
`m = k − n`. With `m = n − k` and `m = 1` the same identity turns the exponential-free part of
the no-call integrals (3) into the en route terms of (1). -/
theorem section_5_1_expected_en_route_time {R v : ℝ} (hR : 0 < R) (hv : 0 < v) (m : ℕ) :
    ∫ t in (0 : ℝ)..R / v, ((R - v * t) / R) ^ m = R / (v * ((m : ℝ) + 1)) := by sorry

end OnDemandRideHailing.CallNoCall
Source
Feng, Kong, Wang, We Are on the Way: Analysis of On-Demand Ride-Hailing Systems, SSRN 2960991, §5.1, unnumbered computation, p. 15

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me