By Topic

A Generic Approach to Multi-fairness and Its Application to Wireless Channel Allocation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mario Koppen ; Kyushu Inst. of Technol., Iizuka, Japan ; Kaori Yoshida ; Masato Tsuru

In this paper we provide an extension of maxmin fairness to the case of multiple objectives and different agent preferences by the definition of the maxmin multi-fairness relation. This generic relation is based on a formal modification of maxmin fairness according to its implicit comparisons and includes maxmin fairness as a special case. The application of this multi-fairness relation to a selfish, to a collaborative and to a mixed community of agents is presented, as well as a case study on a specific task of fair division of indivisible goods by numerical simulations. All studies demonstrate the suitability of the proposed relation for investigative tasks in shared resource problems, as they are abundant in network design and control.

Published in:

Intelligent Networking and Collaborative Systems (INCoS), 2011 Third International Conference on

Date of Conference:

Nov. 30 2011-Dec. 2 2011