The Efficiency of Fair Division

We study the impact of fairness on the efficiency of allocations. We consider three different notions of fairness, namely proportionality, envy-freeness, and equitability for allocations of divisible and indivisible goods and chores. We present a series of results on the price of fairness under the three different notions that quantify the efficiency loss in fair allocations compared to optimal ones. Most of our bounds are either exact or tight within constant factors. Our study is of an optimistic nature and aims to identify the potential of fairness in allocations.

[1]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.

[2]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[3]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[4]  Ariel D. Procaccia Thou Shalt Covet Thy Neighbor's Cake , 2009, IJCAI.

[5]  K. Pruhs,et al.  Cake cutting really is not a piece of cake , 2006, SODA 2006.

[6]  Amit Kumar,et al.  Fairness measures for resource allocation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[7]  Gerhard J. Woeginger,et al.  On the complexity of cake cutting , 2007, Discret. Optim..

[8]  Steven J. Brams,et al.  Fair division - from cake-cutting to dispute resolution , 1998 .