Fairness is a broad concept, covering a range of qualifications such as impartiality, courtesy, equity, sportsmanship, etc. Here, we focus on fairness in exchanging (electronic) goods, stipulating that none of the partners can take an undue advantage over the other. When is an interaction between two or more people called fair? Let us proceed with a few examples which reflect fairness as it is ...

This work facilitates ensuring fairness of machine learning in the real world by decoupling fairness considerations in compound decisions. In particular, this work studies how fairness propagates through a compound decision-making processes, which we call a pipeline. Prior work in algorithmic fairness only focuses on fairness with respect to one decision. However, many decision-making processes...

Abs t rac t . We investigate the notion of fair testing, a formal testing theory in the style of De Nicola and Hennessy, where divergences are disregarded as long as there axe visible outgoing transitions. The usual testing theories, such as the standard model of failure pre-order, do not allow such fair interpretations because of the way in which they ensure their compositionality with respect...

This paper proposes different queuing scenarios to avoid dropping of handoff and new calls in a cellular phone network, which is essential when the network has certain restrictions on the available frequencies. This limitation degrades the performance of the system and more sites are required to achieve the desired capacity and coverage. However, this leads to a higher percentage of call drops ...

In this paper, the video received, IP drop in WFQ is improved using committed access rate (CAR). The committed access rate is used for video and http applications and for WFQ queuing scheme. From results, it has been analyzed that the video received in WFQ shows much better improvement than the conventional. The significant results have been investigated for IP drop in case of WFQ with committe...

Previous covering models for emergency service consider all the calls to be of the same importance and impose the same waiting time constraints independently of the service's priority. This type of constraint is clearly inappropriate in many contexts. For example, in urban medical emergency services, calls that involve danger to human life deserve higher priority over calls for more routine inc...

transition relations. In Proc. 16th Ann. IEEE Symp. on Logic in Computer Science, Boston, MA, June, pp. 51–58.IEEE Computer Society Press, Los Alamitos, CA. [77] Kremer, S. and Raskin, J.-F. (2002) Game analysis of abuse-free contract signing. In Proc. 15th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada,June. IEEE Computer Society Press, Los Alamitos, ...

We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and each voter assigns to each item a certain value. The goal is to select a subset of items with the total cost not exceeding the budget, in a way that is consistent with the voters’ preferences. Since the preferences of th...

Properties of discrete cake-cutting procedures that use a minimal number of cuts (n – 1 if there are n players) are analyzed. None is always envy-free or efficient, but divideand-conquer (D&C) minimizes the maximum number of players that any single player may envy. It works by asking n ≥ 2 players successively to place marks on a cake that divide it into equal or approximately equal halves, the...