The current article explores status as an antecedent of procedural fairness effects (the findings that perceived procedural fairness affects people's reactions, e.g., their relational judgments). On the basis of the literature, the authors proposed that salience of the general concept of status leads people to be more attentive to procedural fairness information and that, as a consequence, stro...

In this paper we present an algorithm to provide local fairness for ring and bus networks with spatial bandwidth reuse. Spatial bandwidth reuse can significantly increase the effective throughput delivered by the network and is therefore desirable to be implemented in high speed LAN/MAN environments. However, spatial bandwidth reuse can result in unfair access among nodes in the network, and th...

With widespread use of machine learning methods in numerous domains involving humans, several studies have raised questions about the potential for unfairness towards certain individuals or groups. A number of recent works have proposed methods to measure and eliminate unfairness from machine learning models. However, most of this work has focused on only one dimension of fair decision making: ...

Existing wireless MAC standards are known to have fairness problems. In this paper, we ask a more fundamental question: should fairness be a property of medium access, or in other words, are we placing the blame on the right place? We argue that fairness is a property of applications and must be implemented by applications. Medium access control should simply provide mechanisms for application-...

Introducing a new concept of (α, β)-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 ≤ α ≤ 1, nor more than β ≥ 1, times its fair share, this paper provides a framework to optimize efficiency (utilization, throughput or revenue) subject to fairness constraints in a general telecommunications network for an arbitrary fairness crit...

Proportional fairness is a concept from resource sharing tasks among n users, where each user receives at least 1/n of her or his total value of the infinitely divisible resource. Here we provide an approach to proportional fairness that allows its extension to discrete domains, as well as for the direct application of evolutionary computation to approximate proportional fair states. We employ ...

Most published concurrent data structures which avoid locking do not provide any fairness guarantees. That is, they allow processes to access a data structure and complete their operations arbitrarily many times before some other trying process can complete a single operation. Such a behavior can be prevented by enforcing fairness. However, fairness requires waiting or helping. Helping techniqu...

A resurgence of arguments for incorporating fairness considerations within domestic competition policies parallels the reemergence of free trade versus fair trade debates at the international level. Where the latter debate can be seen as the result of increasing discontent with globalization reflected in the rise of economic nationalism, the former is a response to a widespread decrease in the ...

The notion of completion has been proposed by Francez et al. (1992) to transform a nonequivalence-robust fairness notion to an equivalence-robust one while maintaining several properties of the source. However, a completion may not preserve strong feasibility|a necessary and su cient condition for a completion to be implementable. In this paper, we study the system requirement for a completion ...