DeepAI
Log In Sign Up

Randomized FIFO Mechanisms

11/21/2021
by   Francisco Castro, et al.
0

We study the matching of jobs to workers in a queue, e.g. a ridesharing platform dispatching drivers to pick up riders at an airport. Under FIFO dispatching, the heterogeneity in trip earnings incentivizes drivers to cherry-pick, increasing riders' waiting time for a match and resulting in a loss of efficiency and reliability. We first present the direct FIFO mechanism, which offers lower-earning trips to drivers further down the queue. The option to skip the rest of the line incentivizes drivers to accept all dispatches, but the mechanism would be considered unfair since drivers closer to the head of the queue may have lower priority for trips to certain destinations. To avoid the use of unfair dispatch rules, we introduce a family of randomized FIFO mechanisms, which send declined trips gradually down the queue in a randomized manner. We prove that a randomized FIFO mechanism achieves the first best throughput and the second best revenue in equilibrium. Extensive counterfactual simulations using data from the City of Chicago demonstrate substantial improvements of revenue and throughput, highlighting the effectiveness of using waiting times to align incentives and reduce the variability in driver earnings.

READ FULL TEXT

page 2

page 20

05/30/2019

Ridesharing with Driver Location Preferences

We study revenue-optimal pricing and driver compensation in ridesharing ...
04/07/2021

The Value of Excess Supply in Spatial Matching Markets

We study dynamic matching in a spatial setting. Drivers are distributed ...
02/27/2019

Reasonable multi-item mechanisms are not much better than item pricing

Multi-item mechanisms can be very complex offering many different bundle...
04/30/2021

Driver Positioning and Incentive Budgeting with an Escrow Mechanism for Ridesharing Platforms

Drivers on the Lyft rideshare platform do not always know where the area...
01/10/2019

Revenue maximization with access and information pricing schemes in a partially-observable queueing game

Today's queueing network systems are more rapidly evolving and more comp...
07/19/2021

A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing [technical report]

With the rapid development of smart mobile devices, the car-hailing plat...
05/15/2020

Towards Assessment of Randomized Mechanisms for Certifying Adversarial Robustness

As a certified defensive technique, randomized smoothing has received co...