You are currently browsing the tag archive for the ‘ride hailing’ tag.
Platooning, driverless cars and ride hailing services have all been suggested as ways to reduce congestion. In this post I want to examine the use of coordination via ride hailing services as a way to reduce congestion. Assume that large numbers of riders decide to rely on ride hailing services. Because the services use Google Maps or Waze for route selection, it would be possible to coordinate their choices to reduce congestion.
To think thorough the implications of this, its useful to revisit an example of Arthur Pigou. There is a measure 1 of travelers all of whom wish to leave the same origin () for the same destination (). There are two possible paths from to . The `top’ one has a travel time of 1 unit independent of the measure of travelers who use it. The `bottom’ one has a travel time that grows linearly with the measure of travelers who employ it. Thus, if fraction of travelers take the bottom path, each incurs a travel time of units.
A central planner, say, Uber, interested in minimizing total travel time will route half of all travelers through the top and the remainder through the bottom. Total travel time will be . The only Nash equilibrium of the path selection game is for all travelers to choose the bottom path yielding a total travel time of . Thus, if the only choice is to delegate my route selection to Uber or make it myself, there is no equilibrium where all travelers delegate to Uber.
Now suppose, there are two competing ride hailing services. Assume fraction of travelers are signed up with Uber and fraction are signed up with Lyft. To avoid annoying corner cases, . Each firm routes its users so as to minimize the total travel time that their users incur. Uber will choose fraction of its subscribers to use the top path and the remaining fraction will use the bottom path. Lyft will choose a fraction of its subscribers to use the top path and the remaining fraction will use the bottom path.
A straight forward calculation reveals that the only Nash equilibrium of the Uber vs. Lyft game is and . An interesting case is when , i.e., Uber has a dominant market share. In this case , i.e., Lyft sends none of its users through the top path. Uber on the hand will send half its users via the top and the remainder by the bottom path. Assuming Uber randomly assigns its users to top and bottom with equal probability, the average travel time for a Uber user will be
The travel time for a Lyft user will be
Total travel time will be , less than in the Nash equilibrium outcome. However, Lyft would offer travelers a lower travel time than Uber. This is because, Uber which has the bulk of travelers, must use the top path to reduce total travel times. If this were the case, travelers would switch from Uber to Lyft. This conclusion ignores prices, which at present are not part of the model.
Suppose we include prices and assume that travelers now evaluate a ride hailing service based on delivered price, that is price plus travel time. Thus, we are assuming that all travelers value time at $1 a unit of time. The volume of customers served by Uber and Lyft is no longer fixed and they will focus on minimizing average travel time per customer. A plausible guess is that there will be an equal price equilibrium where travelers divide evenly between the two services, i.e., . Each service will route of its customers through the top and the remainder through the bottom. Average travel time per customer will be . However, total travel time on the bottom will be , giving every customer an incentive to opt out and drive their own car on the bottom path.
What this simple minded analysis highlights is that the benefits of coordination may be hard to achieve if travelers can opt out and drive themselves. To minimize congestion, the ride hailing services must limit traffic on the bottom path. This is the one that is congestible. However, doing so makes its attractive in terms of travel time encouraging travelers to opt out.