pith. sign in

arxiv: 1905.13191 · v2 · pith:YNFDO4SKnew · submitted 2019-05-30 · 💻 cs.MA · cs.GT

Ridesharing with Driver Location Preferences

classification 💻 cs.MA cs.GT
keywords driverspreferencesdemanddriverlocationmechanismsupplyfirst-best
0
0 comments X
read the original abstract

We study revenue-optimal pricing and driver compensation in ridesharing platforms when drivers have heterogeneous preferences over locations. If a platform ignores drivers' location preferences, it may make inefficient trip dispatches; moreover, drivers may strategize so as to route towards their preferred locations. In a model with stationary and continuous demand and supply, we present a mechanism that incentivizes drivers to both (i) report their location preferences truthfully and (ii) always provide service. In settings with unconstrained driver supply or symmetric demand patterns, our mechanism achieves (full-information) first-best revenue. Under supply constraints and unbalanced demand, we show via simulation that our mechanism improves over existing mechanisms and has performance close to the first-best.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Intermittent Strategic Cooperation of Two Selfish Agents on Graphs

    cs.MA 2026-06 unverdicted novelty 6.0

    Introduces IC2PP as a 2-player shortest-path game and proves existence of at least one Pure Nash Equilibrium in every instance along with a polynomial-time algorithm to enumerate all relevant PNEs.