Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing

• URL: http://arxiv.org/abs/2110.01152v2
• Date: Mon, 19 Jun 2023 05:03:18 GMT
• Title: Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing
• Authors: Hoon Oh, Yanhan Tang, Zong Zhang, Alexandre Jacquillat, Fei Fang
• Abstract summary: This paper focuses on the core problem in P2P ridesharing: the matching of riders and drivers. We introduce novel notions of fairness and stability in P2P ridesharing. Results suggest that fair and stable solutions can be obtained in reasonable computational times.
• Score: 84.47891614815325
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Unlike commercial ridesharing, non-commercial peer-to-peer (P2P) ridesharing has been subject to limited research -- although it can promote viable solutions in non-urban communities. This paper focuses on the core problem in P2P ridesharing: the matching of riders and drivers. We elevate users' preferences as a first-order concern and introduce novel notions of fairness and stability in P2P ridesharing. We propose algorithms for efficient matching while considering user-centric factors, including users' preferred departure time, fairness, and stability. Results suggest that fair and stable solutions can be obtained in reasonable computational times and can improve baseline outcomes based on system-wide efficiency exclusively.

Related papers

• Fairness-Enhancing Vehicle Rebalancing in the Ride-hailing System [7.531863938542706]
  The rapid growth of the ride-hailing industry has revolutionized urban transportation worldwide. Despite its benefits, equity concerns arise as underserved communities face limited accessibility to affordable ride-hailing services. This paper focuses on enhancing both algorithmic and rider fairness through a novel vehicle rebalancing method.
  arXiv  Detail & Related papers  (2023-12-29T23:02:34Z)
• Fair collaborative vehicle routing: A deep multi-agent reinforcement learning approach [49.00137468773683]
  Collaborative vehicle routing occurs when carriers collaborate through sharing their transportation requests and performing transportation requests on behalf of each other. Traditional game theoretic solution concepts are expensive to calculate as the characteristic function scales exponentially with the number of agents. We propose to model this problem as a coalitional bargaining game solved using deep multi-agent reinforcement learning.
  arXiv  Detail & Related papers  (2023-10-26T15:42:29Z)
• Coalitional Bargaining via Reinforcement Learning: An Application to Collaborative Vehicle Routing [49.00137468773683]
  Collaborative Vehicle Routing is where delivery companies cooperate by sharing their delivery information and performing delivery requests on behalf of each other. This achieves economies of scale and thus reduces cost, greenhouse gas emissions, and road congestion. But which company should partner with whom, and how much should each company be compensated? Traditional game theoretic solution concepts, such as the Shapley value or nucleolus, are difficult to calculate for the real-world problem of Collaborative Vehicle Routing.
  arXiv  Detail & Related papers  (2023-10-26T15:04:23Z)
• Using Simple Incentives to Improve Two-Sided Fairness in Ridesharing Systems [27.34946988130242]
  We propose a simple incentive-based fairness scheme that can be implemented online as a part of this ILP formulation. We show how these fairness incentives can be formulated for two distinct use cases for passenger groups and driver fairness.
  arXiv  Detail & Related papers  (2023-03-25T02:24:27Z)
• Competition, Alignment, and Equilibria in Digital Marketplaces [97.03797129675951]
  We study a duopoly market where platform actions are bandit algorithms and the two platforms compete for user participation. Our main finding is that competition in this market does not perfectly align market outcomes with user utility.
  arXiv  Detail & Related papers  (2022-08-30T17:43:58Z)
• An Energy Consumption Model for Electrical Vehicle Networks via Extended Federated-learning [50.85048976506701]
  This paper proposes a novel solution to range anxiety based on a federated-learning model. It is capable of estimating battery consumption and providing energy-efficient route planning for vehicle networks.
  arXiv  Detail & Related papers  (2021-11-13T15:03:44Z)
• Trading the System Efficiency for the Income Equality of Drivers in Rideshare [23.53645438932742]
  We study the income inequality among rideshare drivers due to discriminative cancellations from riders. We propose an online bipartite-matching model where riders are assumed to arrive sequentially following a distribution known in advance.
  arXiv  Detail & Related papers  (2020-12-12T16:04:06Z)
• A multi-objective optimization framework for on-line ridesharing systems [6.247570729758392]
  We propose an algorithm that leverages biogeography-based optimization to solve a multi-objective optimization problem for online ridesharing. We test our algorithm by evaluatingperformance on the Beijing ridesharing dataset.
  arXiv  Detail & Related papers  (2020-12-07T16:25:39Z)
• Predicting Requests in Large-Scale Online P2P Ridesharing [1.8434430658837255]
  Peer-to-peer ridesharing (P2P-RS) enables people to arrange one-time rides with their own private cars, without the involvement of professional drivers. In this paper we tackle the question of assessing the benefit of predicting ridesharing requests in the context of P2P-RS optimisation. Results on a public real-world show that, by employing a perfect predictor, the total reward can be improved by 5.27% with a forecast horizon of 1 minute.
  arXiv  Detail & Related papers  (2020-09-07T10:27:24Z)
• Competing Bandits: The Perils of Exploration Under Competition [99.68537519404727]
  We study the interplay between exploration and competition on online platforms. We find that stark competition induces firms to commit to a "greedy" bandit algorithm that leads to low welfare. We investigate two channels for weakening the competition: relaxing the rationality of users and giving one firm a first-mover advantage.
  arXiv  Detail & Related papers  (2020-07-20T14:19:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.