IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n612018.html
   My bibliography  Save this article

Fair Optimization and Networks: A Survey

Author

Listed:
  • Wlodzimierz Ogryczak
  • Hanan Luss
  • Michał Pióro
  • Dritan Nace
  • Artur Tomaszewski

Abstract

Optimization models related to designing and operating complex systems are mainly focused on some efficiency metrics such as response time, queue length, throughput, and cost. However, in systems which serve many entities there is also a need for respecting fairness: each system entity ought to be provided with an adequate share of the system’s services. Still, due to system operations‐dependant constraints, fair treatment of the entities does not directly imply that each of them is assigned equal amount of the services. That leads to concepts of fair optimization expressed by the equitable models that represent inequality averse optimization rather than strict inequality minimization; a particular widely applied example of that concept is the so‐called lexicographic maximin optimization (max‐min fairness). The fair optimization methodology delivers a variety of techniques to generate fair and efficient solutions. This paper reviews fair optimization models and methods applied to systems that are based on some kind of network of connections and dependencies, especially, fair optimization methods for the location problems and for the resource allocation problems in communication networks.

Suggested Citation

  • Wlodzimierz Ogryczak & Hanan Luss & Michał Pióro & Dritan Nace & Artur Tomaszewski, 2014. "Fair Optimization and Networks: A Survey," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
  • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:612018
    DOI: 10.1155/2014/612018
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/612018
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/612018?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnljam:v:2014:y:2014:i:1:n:612018. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1155/4058 .

    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.