Balancing Efficiency and Fairness in On-Demand Ridesourcing

摘要: We investigate the problem of assigning trip requests to available vehicles in on-demand ridesourcing. Much literature has focused on maximizing total value served requests, achieving efficiency passengers’ side. However, such solutions may result some drivers being assigned insufficient or undesired trips, therefore losing fairness from drivers’ perspective. In this paper, we focus both system and among quantitatively analyze trade-offs between these two objectives. particular, give an explicit answer question whether there always exists assignment that achieves any target fairness. also propose a simple reassignment algorithm can achieve selected trade-off. Finally, demonstrate effectiveness algorithms through extensive experiments real-world datasets.