Interconnection networks of parallel systems are used for servicing traffic generated by different applications, often belonging to different users. When multiple traffic flows contend for channel bandwidth, the scheduling algorithm regulating the access to that channel plays a key role in ensuring that each flow obtains the required quality of service. Fairness is a highly desirable property f...

We study the problem of learning classifiers with a fairness constraint, with three main contributions towards the goal of quantifying the problem’s inherent tradeoffs. First, we relate two existing fairness measures to cost-sensitive risks. Second, we show that for cost-sensitive classification and fairness measures, the optimal classifier is an instance-dependent thresholding of the class-pro...

Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficult to define and so it has been studied only sporadically. This has changed over the last decade a...

In this paper we study resource allocation problems that involve multiple self-interested parties or players, and a central decision maker. We introduce and study the price of fairness, which is the relative system efficiency loss under a “fair” allocation assuming that a fully efficient allocation is one that maximizes the sum of player utilities. We focus on two well accepted, axiomatically j...

The fairness hierarchy and conspiracies, the notions introduced by Best, are studied in the context of elementary nets. Proving that sequential as well as persistent systems are conspiracy-free, we indicate two main roots of conspiracies: distributed memory and conflicts. Using the notion of markingfairness, due to Merceron, we prove that T0-fairness + M0-fairness = T∞fairness. This result give...

Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications. Service time variability across jobs is an important factor affecting both system performance and scheduling rules (for example, computer systems that prioritize short jobs over long jobs). Service time variability and its effects on mean response times have been studied exte...

We present the axiom of weighted component fairness for the class of forest games, a generalization of component fairness introduced by Herings, Talman and van der Laan (2008) in order to characterize the average tree solution. Given a system of weights, component efficiency and weighted component fairness yield a unique allocation rule. We provide an analysis of the set of allocation rules gen...

In this letter, we propose a new resource allocation scheme for a two-way OFDM relay network with fairness constraints. To maximize sum capacity, subcarriers and their power are successively allocated to the relays based on channel conditions. Also, the power constraint is imposed on each relay to achieve fairness for the relays. Simulation results show that the proposed scheme improves sum cap...

In this work we analyze the performance of scheduling algorithms with respect to fairness. Existing works frequently consider fairness as a job related issue. In our work we analyze fairness with respect to different users of the system as this is a very important real-life problem. First, we discuss how fair are selected popular scheduling algorithms with respect to different users of the syst...