Next, we have studied performances of the above two solution concepts against max min fairness algorithm (benchmarked in our case) with respect to the above objectives of LSC.
Because most negotiators understand such appeals to fairness, monetary benchmarks, such as "most favored nation" or "most favored customer" clauses in business contracts, can be an effective means of holding firm on price and closing a negotiation.
Indeed, Daniels et al. found a similar benefit to using their benchmarks for fairness in health care reform, since their benchmarks assisted in identifying "places where proposed reforms were insufficiently detailed or vague about mechanisms to reveal their effects; [and in revealing] problematic assumptions about how goals of reform would be achieved" [32].
Simulation results showed a noticeable performance improvement in spectral efficiency and fairness comparing to the benchmark algorithms proposed in [5, 7] under different settings; SRM and WSRM.
In the current paper, subjects carrying the 4-repeat allele display a more exacting benchmark for fairness and demand a more equitable wealth distribution in the UG.
In hard times, the benchmark for fairness may vary and increase fitness by allowing environment (e.g. harsh winter, low food supplies, winter flu) to reprogram the internal benchmark of fairness nudging the individual to a state of increased fitness in interpersonal relationship and social interaction.
A promising example comes from the work on benchmarks of fairness for health care reform in several developing countries [ 64, 65].
Simulation results show that the proposed schemes can result in significant gain in terms of network goodput, without compromising fairness, with respect to two benchmark solutions taken from the literature.
Figure 1 Spectral efficiency comparison of the proposed algorithm and the benchmarks for SRM and WSRM. Figure 2 Jain's fairness index comparison of the proposed algorithm and the benchmarks for SRM and WSRM.
The performance of the proposed algorithm will be evaluated and compared with the benchmark algorithms using spectral efficiency and fairness.
Our main goal is to study the fairness and efficiency performance of the proposed and benchmark scheduling rules when the delay bound and packet loss threshold constraints are considered.
