Fair Distribution of Delivery Orders

by   Hadi Hosseini, et al.

We initiate the study of fair distribution of delivery tasks among a set of agents wherein delivery jobs are placed along the vertices of a graph. Our goal is to fairly distribute delivery costs (modeled as a submodular function) among a fixed set of agents while satisfying some desirable notions of economic efficiency. We adopt well-established fairness conceptsx2014such as envy-freeness up to one item (EF1) and minimax share (MMS)x2014to our setting and show that fairness is often incompatible with the efficiency notion of social optimality. Yet, we characterize instances that admit fair and socially optimal solutions by exploiting graph structures. We further show that achieving fairness along with Pareto optimality is computationally intractable. Nonetheless, we design an XP algorithm (parameterized by the number of agents) for finding MMS and Pareto optimal solutions on every instance, and show that the same algorithm can be modified to find efficient solutions along with EF1, when such solutions exist. We complement our theoretical results by experimentally analyzing the price of fairness on randomly generated graph structures.


page 1

page 2

page 3

page 4


Repeated Fair Allocation of Indivisible Items

The problem of fairly allocating a set of indivisible items is a well-kn...

On Fair Division with Binary Valuations Respecting Social Networks

We study the computational complexity of finding fair allocations of ind...

Equitable Allocations of Indivisible Goods

In fair division, equitability dictates that each participant receives t...

Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items

We study the fair division of items to agents supposing that agents can ...

Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods

In fair division of indivisible goods, using sequences of sincere choice...

Achieving Proportionality up to the Maximin Item with Indivisible Goods

We study the problem of fairly allocating indivisible goods and focus on...

Please sign up or login with your details

Forgot password? Click here to reset