IDEAS home Printed from
   My bibliography  Save this article

Fair resource allocation for different scenarios of demands


  • Medernach, Emmanuel
  • Sanlaville, Eric


This paper considers a resource allocation problem, which objective is to treat fairly all the system users. Usually the requests cannot be entirely predicted, but the manager can forecast the request evolution, this leading to a set of possible scenarios. Such a problem arises for instance in network bandwidth allocation as well as in storage space management. It also appears in the management of computer systems, such as computational grids or in cloud computing, when teams share a common pool of machines. Problems of fair resource sharing arise among users with equal access right but with different needs.

Suggested Citation

  • Medernach, Emmanuel & Sanlaville, Eric, 2012. "Fair resource allocation for different scenarios of demands," European Journal of Operational Research, Elsevier, vol. 218(2), pages 339-350.
  • Handle: RePEc:eee:ejores:v:218:y:2012:i:2:p:339-350
    DOI: 10.1016/j.ejor.2011.10.029

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Kostreva, Michael M. & Ogryczak, Wlodzimierz & Wierzbicki, Adam, 2004. "Equitable aggregations and multiple criteria analysis," European Journal of Operational Research, Elsevier, vol. 158(2), pages 362-377, October.
    2. Maniquet, François, 2008. "Social orderings for the assignment of indivisible objects," Journal of Economic Theory, Elsevier, vol. 143(1), pages 199-215, November.
    3. Hites, R. & De Smet, Y. & Risse, N. & Salazar-Neumann, M. & Vincke, P., 2006. "About the applicability of MCDA to some robustness problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 322-332, October.
    4. Ogryczak, Wlodzimierz & Wierzbicki, Adam & Milewski, Marcin, 2008. "A multi-criteria approach to fair and efficient bandwidth allocation," Omega, Elsevier, vol. 36(3), pages 451-463, June.
    5. Ogryczak, Wlodzimierz, 1997. "On the lexicographic minimax approach to location problems," European Journal of Operational Research, Elsevier, vol. 100(3), pages 566-585, August.
    6. Salles, Ronaldo M. & Barria, Javier A., 2008. "Lexicographic maximin optimisation for fair bandwidth allocation in computer networks," European Journal of Operational Research, Elsevier, vol. 185(2), pages 778-794, March.
    7. Erik Taflin, 1999. "Equity Allocation and Portfolio Selection in Insurance," Papers math/9907160,
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.


    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:eee:ejores:v:218:y:2012:i:2:p:339-350. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.