Theory of Computing Systems

, Volume 50, Issue 4, pp 589–610

The Efficiency of Fair Division

  • Ioannis Caragiannis
  • Christos Kaklamanis
  • Panagiotis Kanellopoulos
  • Maria Kyropoulou
Article

DOI: 10.1007/s00224-011-9359-y

Cite this article as:
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P. et al. Theory Comput Syst (2012) 50: 589. doi:10.1007/s00224-011-9359-y

Abstract

In this paper 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.

Keywords

Cake-cuttingFair allocationsEnvy-freenessPrice of fairness

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Ioannis Caragiannis
    • 1
  • Christos Kaklamanis
    • 1
  • Panagiotis Kanellopoulos
    • 1
  • Maria Kyropoulou
    • 1
  1. 1.Research Academic Computer Technology Institute and Department of Computer Engineering and InformaticsUniversity of PatrasRioGreece