IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_11.html
   My bibliography  Save this book chapter

Fair Resource Allocation by Gini Index Minimization

In: Operations Research Proceedings 2018

Author

Listed:
  • Wlodzimierz Ogryczak

    (Warsaw University of Technology)

  • Grzegorz Zalewski

    (National Institute of Telecommunications)

Abstract

In many resource allocation problems there is a need to minimize inequity to respect some fairness rules while looking for the overall efficiency. The Gini index representing the relative mean absolute difference of outcomes is the classical measure of inequity in outcome distribution. It was empirically found in real-life applications that the Gini index minimization while equalizing the outcomes it may simultaneously support their maximization (allocation efficiency). However, it depends on the feasible set structure and there is no guarantee to achieve good equitable and efficient allocation scheme. We show that with appropriate outcome shift the Gini index minimization is consistent both with inequity minimization and with outcomes maximization thus guaranteeing equitable allocation schemes. The interval of appropriate target values depends on the problem structure (feasible set). Although it can be found or adjusted during the optimization process without necessity of a special feasible set analysis.

Suggested Citation

  • Wlodzimierz Ogryczak & Grzegorz Zalewski, 2019. "Fair Resource Allocation by Gini Index Minimization," Operations Research Proceedings, in: Bernard Fortz & Martine LabbĂ© (ed.), Operations Research Proceedings 2018, pages 77-83, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_11
    DOI: 10.1007/978-3-030-18500-8_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-030-18500-8_11. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.