Fair resource allocation for different scenarios of demands
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 218 (2012)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/locate/eor|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Francois Maniquet, 2002.
"Social Orderings for the Assignment of Indivisible Objects,"
Economics Working Papers
0015, Institute for Advanced Study, School of Social Science.
- Maniquet, François, 2008. "Social orderings for the assignment of indivisible objects," Journal of Economic Theory, Elsevier, vol. 143(1), pages 199-215, November.
- MANIQUET, François, "undated". "Social orderings for the assignment of indivisible objects," CORE Discussion Papers RP 2169, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- 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.
- 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.
- 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.
- 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.
- Ogryczak, Wlodzimierz, 1997. "On the lexicographic minimax approach to location problems," European Journal of Operational Research, Elsevier, vol. 100(3), pages 566-585, August.
- Erik Taflin, 1999. "Equity Allocation and Portfolio Selection in Insurance," Papers math/9907160, arXiv.org.
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)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.