Model checking of liveness properties often results in unrealistic, unfair infinite behaviors as counterexamples. Fairness is a notion where the search is constrained to infinite paths that do not ignore infinitely the execution of a set of enabled actions. In this work we present an implementation for efficient checking of LTL formulas under strong and weak fairness in ProB, available for mode...

This paper gives a new definition of general weighted (GW) fairness and shows how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 specifications. The GW fairness can be achieved by calculating the ExcessFairshare (weighted fairshare of the left over bandwidth) for each VC. We show how a switch algorithm can be modified to support the GW fairness by...

Calders and Verwer’s two-naive-Bayes is one of fairness-aware classifiers, which classify objects while excluding the influence of a specific information. We analyze why this classifier achieves very high level of the fairness, and show that this is due to a decision rules and a model bias. Based on these findings, we develop methods that are grounded on rigid theory and are applicable to wider...

This is the second part of a two-part paper in which we discuss the implementability of fairness notions in distributed systems where asynchronous processes interact via multiparty interactions. We focus here on equivalence-robust fairness notions where equivalence computations are either all fair or all unfair. Francez et al. (1992, Formal Aspects Comput. 4, 582–591) propose a notion of comple...

We are concerned with the control of quality of service (QoS) in wireless cellular networks utilizing linear receivers. We investigate the issues of fairness and total performance, which are measured by a utility function in the form of a weighted sum of link QoS. We disprove the common conjecture on incompatibility of min-max fairness and utility optimality by characterizing network classes in...

Two experiments were conducted to investigate the impact of fairness on the efficiency of resource allocation decisions. In Experiment 1 participants allocated payoffs to one privileged and one unprivileged group in a multi-stage decision task. Conflicts between fairness and resource preservation were induced. Selfinterest was varied by awarding participants a high or low bonus if a majority of...

Existing research suggests that concerns for fairness may significantly affect the interactions between firms in a distribution channel. We analytically and experimentally evaluate how firms make decisions in a two-stage dyadic channel, in which firms decide on investments in the first stage and then on prices in the second stage. We find that firms’ behavior differs significantly from the pred...

A number of emerging Internet applications such as videoconferencing and live multimedia broadcasts from Internet TV stations will rely on scheduling algorithms in switches and routers to guarantee performance and an acceptable level of quality of service. Fairness in packet schedulers is an intuitively desirable property with practical value; fair schedulers such as Weighted Fair Queueing are ...

Fair exchange between two or more potentially mutually distrusted parties has been identified as an important issue in electronic commerce. However, the correctness (fairness) of the existing fair exchange protocols that use a Trusted Third Party (TTP) is based on the assumption that during an exchange there are no failures at any of the local systems involved in the exchange, which is too stro...