Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Fair Welfare Maximization
 
research article

Fair Welfare Maximization

Weber, Thomas A.  
•
Goel, Ashish
•
Meyerson, Adam
2009
Economic Theory

We consider the general problem of finding fair constrained resource allocations. As a criterion for fairness we propose an inequality index, termed “fairness ratio,” the maximization of which produces Lorenz-undominated, Pareto-optimal allocations. The fairness ratio does not depend on the choice of any particular social welfare function, and hence it can be used for an a priori evaluation of any given feasible resource allocation. The fairness ratio for an allocation provides a bound on the discrepancy between this allocation and any other feasible allocation with respect to a large class of social welfare functions. We provide a simple representation of the fairness ratio as well as a general method that can be used to directly determine optimal fair allocations. For general convex environments, we provide a fundamental lower bound for the optimal fairness ratio and show that as the population size increases, the optimal fairness ratio decreases at most logarithmically in what we call the “inhomo-geneity” of the problem. Our method yields a unique and “balanced” fair optimum for an important class of problems with linear budget constraints.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

GMW-ET-2009.pdf

Access type

openaccess

Size

402.2 KB

Format

Adobe PDF

Checksum (MD5)

b2853e856b157a7e25f80a10a7d4df4a

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés