Abstract
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.
This work is partially supported by the European Union under IST FET Integrated Project FP6-015964 AEOLUS and Cost Action IC0602 “Algorithmic Decision Theory”, and by a “Caratheodory” basic research grant from the University of Patras.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM Journal of Computing 38(4), 1602–1623 (2008)
Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC 2006), pp. 31–40 (2006)
Brams, S.J., Taylor, A.D.: Fair division: From cake-cutting to dispute resolution. Cambridge University Press, Cambridge (1996)
Edmonds, J., Pruhs, K.: Cake-cutting really is not a piece of cake. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 271–278 (2006)
Kumar, A., Kleinberg, J.: Fairness measures for resource allocation. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), pp. 75–85 (2000)
Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce (EC 2004), pp. 125–131 (2004)
Procaccia, A.: Thou shalt covet thy neighbor’s cake. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009 (2009)
Woeginger, G.J., Sgall, J.: On the complexity of cake-cutting. Discrete Optimization 4, 213–220 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M. (2009). The Efficiency of Fair Division. In: Leonardi, S. (eds) Internet and Network Economics. WINE 2009. Lecture Notes in Computer Science, vol 5929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-10841-9_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10840-2
Online ISBN: 978-3-642-10841-9
eBook Packages: Computer ScienceComputer Science (R0)