Relational approaches to resource-aware multi-maxmin fairness in multi-valued resource sharing tasks
by Mario Köppen; Kaori Yoshida; Masato Tsuru
International Journal of Space-Based and Situated Computing (IJSSC), Vol. 3, No. 2, 2013

Abstract: Here we study formal approaches to maxmin fairness in multi-valued evaluations. In such resource sharing or distribution tasks among agents, each share has multiple evaluations according to different observables. Maxmin fairness cannot be directly applied in this situation. To allow handling of fairness aspects in such circumstances as well, we promote a strict relational framework. Maxmin fairness will be specified as a set-theoretic relation in two alternative ways, thus generalising maxmin fairness for multi-vectors. In addition, the relation will be restricted by an additional resource fairness criterion. For an example case of multi-resource allocations, the higher utilisation of resources will be demonstrated.

Online publication date: Sat, 23-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Space-Based and Situated Computing (IJSSC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com