Fair Division meets Vehicle Routing: Fairness for Drivers with Monotone Profits

We propose a new model for fair division and vehicle routing, where drivers have monotone profit preferences, and their vehicles have feasibility constraints, for customer requests. For this model, we design two new axiomatic notions for fairness for drivers: FEQ1 and FEF1. FEQ1 encodes driver pairwise bounded equitability. FEF1 encodes driver pairwise bounded envy freeness. We compare FEQ1 and FEF1 with popular fair division notions such as EQ1 and EF1. We also give algorithms for guaranteeing FEQ1 and FEF1, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2021

Two-Sided Matching Meets Fair Division

We introduce a new model for two-sided matching which allows us to borro...
research
06/29/2020

Monotone and Online Fair Division

We study a new but simple model for online fair division in which indivi...
research
11/11/2017

Communication Complexity of Discrete Fair Division

We initiate the study of the communication complexity of fair division w...
research
02/15/2022

Fair Division of Indivisible Goods: A Survey

Allocating resources to individuals in a fair manner has been a topic of...
research
12/12/2020

Trading the System Efficiency for the Income Equality of Drivers in Rideshare

Several scientific studies have reported the existence of the income gap...
research
12/18/2019

Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hours

Rideshare platforms, when assigning requests to drivers, tend to maximiz...
research
02/02/2021

A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows

A vehicle routing and crew scheduling problem (VRCSP) consists of simult...

Please sign up or login with your details

Forgot password? Click here to reset