Ride-hailing platform: Science
Principles
The science it rests on, with why each principle matters to it
Relies on- Graph theory The road map is stored as a graph of junctions and streets, and route and arrival-time estimates are shortest-path searches on it.
- Queueing theory Waiting riders and free drivers form queues, and the theory Erlang began for telephone calls in 1909 [4] predicts waiting times as supply and demand change.
as of 2026-11-11
Discoveries
The discoveries that made it possible: when, by whom and what was found
| Year | Who | What |
|---|---|---|
| 1736 | Leonhard Euler | Solves the Königsberg bridges problem, the start of graph theory [3] |
| 1909 | Agner Krarup Erlang | First paper on the probability of telephone traffic, the start of queueing theory [4] |
| 1917 | Agner Krarup Erlang | A formula for loss and waiting time, soon used by telephone companies [4] |
as of 2026-11-11
The science explained
The science behind it explained for a curious reader
A city's streets can be drawn as dots for junctions and lines for roads, the kind of network Euler first studied in 1736 [3]. Finding the quickest way for a driver to reach a rider is a search for the shortest path through that network, with each line weighted by how long it takes to drive. Matching is the second problem. Think of a telephone exchange in Erlang's day: calls arrive at random, lines are limited, and the question is how long callers wait [4]. Riders and drivers behave the same way. Too few drivers and waits grow sharply; too many and drivers sit idle. Dynamic pricing is a lever on both queues: fares rise when riders outnumber free drivers, to restore the balance [6].
as of 2026-11-11
Sources
- Maths in a minute: The bridges of Königsberg Plus Magazine, University of Cambridge
- Agner Krarup Erlang INFORMS, History of O.R. Excellence
- Uber Marketplace Surge pricing Uber