mlsanityData to 7 Oct 2026

Long-term Fairness in Ride-Hailing Platform

arXiv 2407.17839 ↗First posted 25 Jul 2024cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Matching in two-sided markets such as ride-hailing has recently received significant attention. However, existing studies on ride-hailing mainly focus on optimising efficiency, and fairness issues in ride-hailing have been neglected. Fairness issues in ride-hailing, including significant earning differences between drivers and variance of passenger waiting times among different locations, have potential impacts on economic and ethical aspects. The recent studies that focus on fairness in ride-hailing exploit traditional optimisation methods and the Markov Decision Process to balance efficiency and fairness. However, there are several issues in these existing studies, such as myopic short-term decision-making from traditional optimisation and instability of fairness in a comparably longer horizon from both traditional optimisation and Markov Decision Process-based methods. To address these issues, we propose a dynamic Markov Decision Process model to alleviate fairness issues currently faced by ride-hailing, and seek a balance between efficiency and fairness, with two distinct characteristics: (i) a prediction module to predict the number of requests that will be raised in the future from different locations to allow the proposed method to consider long-term fairness based on the whole timeline instead of consider fairness only based on historical and current data patterns; (ii) a customised scalarisation function for multi-objective multi-agent Q Learning that aims to balance efficiency and fairness. Extensive experiments on a publicly available real-world dataset demonstrate that our proposed method outperforms existing state-of-the-art methods.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 23 references that are in the map. First posted on arXiv 25 Jul 2024.

Builds on

9 of 23 references.

References · 9

  1. 2019Neural Approximate Dynamic Programming for On-Demand Ride-Poolingcited by 33
  2. 2020Exploring Algorithmic Fairness in Robust Graph Covering Problemscited by 19
  3. 2019Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hourscited by 17
  4. 2020Group-level Fairness Maximization in Online Bipartite Matchingcited by 13
  5. 2021Data-Driven Methods for Balancing Fairness and Efficiency in Ride-Poolingcited by 9
  6. 2020Efficient Ridesharing Dispatch Using Multi-Agent Reinforcement Learningcited by 7
  7. 2020Trading the System Efficiency for the Income Equality of Drivers in Ridesharecited by 7
  8. 2023Using Simple Incentives to Improve Two-Sided Fairness in Ridesharing Systemscited by 5
  9. 2024Promoting Two-sided Fairness in Dynamic Vehicle Routing Problemcited by 2

Built on by

Not cited yet.