In this paper, we consider fair assignment of complex requests for Mobility-On-Demand systems. We model the transportation requests as temporal logic formulas that must be satisfied by a fleet of vehicles. We require that the assignment of requests to vehicles is performed in a distributed manner based only on communication between vehicles while ensuring fair allocation. Our approach to the vehicle-request assignment problem is based on a distributed auction scheme with no centralized bidding that leverages utility history correction of bids to improve fairness. Complementarily, we propose a rebalancing scheme that employs rerouting vehicles to more rewarding areas to increase the potential future utility and ensure a fairer utility distribution. We adopt the max-min and deviation of utility as the two criteria for fairness. We demonstrate the methods in the mid-Manhattan map with a large number of requests generated in different probability settings. We show that we increase the fairness between vehicles based on the fairness criteria without degenerating the servicing quality.

中文翻译：

---

通过基于拍卖的方法实现按需移动系统的分布式公平分配和再平衡

在本文中，我们考虑对按需移动系统的复杂请求进行公平分配。我们将运输请求建模为车队必须满足的时间逻辑公式。我们要求对车辆的请求分配仅基于车辆之间的通信以分布式方式进行，同时确保公平分配。我们解决车辆请求分配问题的方法基于分布式拍卖方案，没有集中投标，利用投标的公用事业历史修正来提高公平性。作为补充，我们提出了一种重新平衡方案，利用重新路由车辆到更有价值的区域，以增加未来的潜在效用并确保更公平的效用分配。我们采用效用的最大最小和偏差作为公平的两个标准。我们在曼哈顿中部地图上演示了这些方法，其中包含在不同概率设置下生成的大量请求。我们表明，我们根据公平标准提高了车辆之间的公平性，而不会降低服务质量。