IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/612018.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, Hindawi, vol. 2014, pages 1-25, September.
  • Handle: RePEc:hin:jnljam:612018
    DOI: 10.1155/2014/612018
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2014/612018.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/JAM/2014/612018.xml
    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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lehuédé, Fabien & Péton, Olivier & Tricoire, Fabien, 2020. "A lexicographic minimax approach to the vehicle routing problem with route balancing," European Journal of Operational Research, Elsevier, vol. 282(1), pages 129-147.
    2. David Rea & Craig Froehle & Suzanne Masterson & Brian Stettler & Gregory Fermann & Arthur Pancioli, 2021. "Unequal but Fair: Incorporating Distributive Justice in Operational Allocation Models," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2304-2320, July.
    3. Gutjahr, Walter J., 2021. "Inequity-averse stochastic decision processes," European Journal of Operational Research, Elsevier, vol. 288(1), pages 258-270.
    4. Philippe Ezran & Yoram Haddad & Mérouane Debbah, 2019. "Allais’ paradox and resource allocation in telecommunication networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 70(3), pages 337-348, March.
    5. Acuna, Jorge A. & Zayas-Castro, José L. & Charkhgard, Hadi, 2020. "Ambulance allocation optimization model for the overcrowding problem in US emergency departments: A case study in Florida," Socio-Economic Planning Sciences, Elsevier, vol. 71(C).
    6. Bevrani, Bayan & Burdett, Robert & Bhaskar, Ashish & Yarlagadda, Prasad K.D.V., 2020. "A multi-criteria multi-commodity flow model for analysing transportation networks," Operations Research Perspectives, Elsevier, vol. 7(C).
    7. Argyris, Nikolaos & Karsu, Özlem & Yavuz, Mirel, 2022. "Fair resource allocation: Using welfare-based dominance constraints," European Journal of Operational Research, Elsevier, vol. 297(2), pages 560-578.
    8. Wenhang Bao, 2019. "Fairness in Multi-agent Reinforcement Learning for Stock Trading," Papers 2001.00918, arXiv.org.
    9. Natalia Novikova & Irina Pospelova, 2022. "Germeier’s Scalarization for Approximating Solution of Multicriteria Matrix Games," Mathematics, MDPI, vol. 11(1), pages 1-28, December.
    10. Violet Xinying Chen & J. N. Hooker, 2023. "A guide to formulating fairness in an optimization model," Annals of Operations Research, Springer, vol. 326(1), pages 581-619, July.
    11. Christ, Quentin & Dauzère-Pérès, Stéphane & Lepelletier, Guillaume, 2019. "An Iterated Min–Max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems," European Journal of Operational Research, Elsevier, vol. 279(2), pages 419-428.

    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:hin:jnljam: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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.