The cost of convenience: Ridehailing and traffic fatalities
We examine the effect of the introduction of ridehailing in US cities on fatal traffic accidents.
The arrival of ridehailing is associated with an approximately 3% increase in the number of …
The arrival of ridehailing is associated with an approximately 3% increase in the number of …
Edge weighted online windowed matching
Motivated by applications from ride-sharing and kidney exchange, we study the problem of
matching agents who arrive at a marketplace over time and leave after d time periods …
matching agents who arrive at a marketplace over time and leave after d time periods …
Dynamic pricing of relocating resources in large networks
We study dynamic pricing of resources that are distributed over a network of locations (eg,
shared vehicle systems and logistics networks). Customers with private willingness-to-pay …
shared vehicle systems and logistics networks). Customers with private willingness-to-pay …
Spatial capacity planning
We study the relationship between capacity and performance for a service firm with spatial
operations, in the sense that requests arrive with origin-destination pairs. An example of …
operations, in the sense that requests arrive with origin-destination pairs. An example of …
Randomized FIFO mechanisms
We study the matching of jobs to workers in a queue, eg a ridesharing platform dispatching
drivers to pick up riders at an airport. Under FIFO dispatching, the heterogeneity in trip …
drivers to pick up riders at an airport. Under FIFO dispatching, the heterogeneity in trip …
On the optimal design of a bipartite matching queueing system
We consider a multiclass multiserver queueing system and study the problem of designing
an optimal matching topology (or service compatibility structure) between customer classes …
an optimal matching topology (or service compatibility structure) between customer classes …
Maximum weight online matching with deadlines
We study the problem of matching agents who arrive at a marketplace over time and leave
after d time periods. Agents can only be matched while they are present in the marketplace …
after d time periods. Agents can only be matched while they are present in the marketplace …
Dynamic pricing and matching for two-sided queues
SM Varma, P Bumpensanti, ST Maguluri… - Operations …, 2023 - pubsonline.informs.org
Motivated by applications from gig economy and online marketplaces, we study a two-sided
queueing system under joint pricing and matching controls. The queueing system is …
queueing system under joint pricing and matching controls. The queueing system is …
[PDF][PDF] State dependent control of closed queueing networks with application to ride-hailing
Inspired by ride-hailing and bike-sharing systems, we study the design of state-dependent
controls for a closed queueing network model. We focus on the assignment policy, where …
controls for a closed queueing network model. We focus on the assignment policy, where …
Real-time approximate routing for smart transit systems
We study real-time routing policies in smart transit systems, where the platform has a
combination of cars and high-capacity vehicles (eg, buses or shuttles) and seeks to serve a …
combination of cars and high-capacity vehicles (eg, buses or shuttles) and seeks to serve a …