Data-Driven Methods for Balancing Fairness and Efficiency in Ride-Pooling

• URL: http://arxiv.org/abs/2110.03524v1
• Date: Thu, 7 Oct 2021 14:53:37 GMT
• Title: Data-Driven Methods for Balancing Fairness and Efficiency in Ride-Pooling
• Authors: Naveen Raman, Sanket Shah, John Dickerson
• Abstract summary: We investigate two methods to reduce forms of inequality in ride-pooling platforms. First, we find that optimizing for driver-side fairness outperforms state-of-the-art models on the number of riders serviced. Second, we explore income redistribution as a way to combat income inequality by having drivers keep an $r$ fraction of their income, and contribute the rest to a redistribution pool.
• Score: 10.613763106603272
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Rideshare and ride-pooling platforms use artificial intelligence-based matching algorithms to pair riders and drivers. However, these platforms can induce inequality either through an unequal income distribution or disparate treatment of riders. We investigate two methods to reduce forms of inequality in ride-pooling platforms: (1) incorporating fairness constraints into the objective function and (2) redistributing income to drivers to reduce income fluctuation and inequality. To evaluate our solutions, we use the New York City taxi data set. For the first method, we find that optimizing for driver-side fairness outperforms state-of-the-art models on the number of riders serviced, both in the worst-off neighborhood and overall, showing that optimizing for fairness can assist profitability in certain circumstances. For the second method, we explore income redistribution as a way to combat income inequality by having drivers keep an $r$ fraction of their income, and contributing the rest to a redistribution pool. For certain values of $r$, most drivers earn near their Shapley value, while still incentivizing drivers to maximize value, thereby avoiding the free-rider problem and reducing income variability. The first method can be extended to many definitions of fairness and the second method provably improves fairness without affecting profitability.

Related papers

• Towards Harmless Rawlsian Fairness Regardless of Demographic Prior [57.30787578956235]
  We explore the potential for achieving fairness without compromising its utility when no prior demographics are provided to the training set. We propose a simple but effective method named VFair to minimize the variance of training losses inside the optimal set of empirical losses.
  arXiv  Detail & Related papers  (2024-11-04T12:40:34Z)
• 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)
• Mutual Information as Intrinsic Reward of Reinforcement Learning Agents for On-demand Ride Pooling [19.247162142334076]
  On-demand vehicle pooling services allow each vehicle to serve multiple passengers at a time. Existing algorithms often only consider revenue, which makes it difficult for requests with unusual distribution to get a ride. We propose a framework for dispatching for ride pooling tasks, which splits the city into discrete dispatching and uses the reinforcement learning (RL) algorithm to dispatch vehicles in these regions.
  arXiv  Detail & Related papers  (2023-12-23T08:34:52Z)
• 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)
• DualFair: Fair Representation Learning at Both Group and Individual Levels via Contrastive Self-supervision [73.80009454050858]
  This work presents a self-supervised model, called DualFair, that can debias sensitive attributes like gender and race from learned representations. Our model jointly optimize for two fairness criteria - group fairness and counterfactual fairness.
  arXiv  Detail & Related papers  (2023-03-15T07:13:54Z)
• How Robust is Your Fairness? Evaluating and Sustaining Fairness under Unseen Distribution Shifts [107.72786199113183]
  We propose a novel fairness learning method termed CUrvature MAtching (CUMA) CUMA achieves robust fairness generalizable to unseen domains with unknown distributional shifts. We evaluate our method on three popular fairness datasets.
  arXiv  Detail & Related papers  (2022-07-04T02:37:50Z)
• Domain Adaptation meets Individual Fairness. And they get along [48.95808607591299]
  We show that algorithmic fairness interventions can help machine learning models overcome distribution shifts. In particular, we show that enforcing suitable notions of individual fairness (IF) can improve the out-of-distribution accuracy of ML models.
  arXiv  Detail & Related papers  (2022-05-01T16:19:55Z)
• Towards Equal Opportunity Fairness through Adversarial Learning [64.45845091719002]
  Adversarial training is a common approach for bias mitigation in natural language processing. We propose an augmented discriminator for adversarial training, which takes the target class as input to create richer features.
  arXiv  Detail & Related papers  (2022-03-12T02:22:58Z)
• Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing [84.47891614815325]
  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.
  arXiv  Detail & Related papers  (2021-10-04T02:14:49Z)
• Learning to be Fair: A Consequentialist Approach to Equitable Decision-Making [21.152377319502705]
  We present an alternative framework for designing equitable algorithms. In our approach, one first elicits stakeholder preferences over the space of possible decisions. We then optimize over the space of decision policies, making trade-offs in a way that maximizes the elicited utility.
  arXiv  Detail & Related papers  (2021-09-18T00:30:43Z)
• 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)

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.