Fairness Management

  • Adam Wierzbicki
Part of the Studies in Computational Intelligence book series (SCI, volume 298)


By Fairness Management we refer to a wide variety of techniques that aim to improve the procedural or distributional fairness of ODS. This chapter begins with a consideration of Fairness Management for resource sharing in an ODS, and presents various application areas where such a problem needs to be solved. The discussion of these application areas will be accompanied by case studies that present various Fairness Management techniques. Most of these techniques can be described using the concepts of the theory of fairness introduced in section 2.3. The case studies have been selected so that they demonstrate various kinds of fair distribution problems. The first example of a fair scheduling in grids is a decentralized problem, in which a solution cannot be imposed on the participants. On the other hand, in the second example of a network dimensioning problem, the fair solution can be implemented by a central control – network management. The two cases differ also in other respects; the first problem has an extremely large solution space and a heuristic method is presented for finding equitable solutions, while the second problem is formulated as a Mixed Integer Linear Optimization problem and solved by a CPLEX solver. As a third example, we consider fairness in Peer-to-Peer systems that are even more decentralized than grids.


Priority Queue Trust Management Link Capacity Reputation System Order Weight Average 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Adam Wierzbicki

    There are no affiliations available

    Personalised recommendations