We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.

This report considers the problems of scheduling transmissions in broadcast environments, including, wireless environments. Issues that affect the design of fair scheduling algorithms, and several alternative approaches to implementing fair scheduling in single-hop and multi-hop environments are identified.

The fair way to decide an election between two candidates a and b is majority rule; if more than half the electorate prefer a to b, then a is elected; otherwise b is elected. Arrow’s theorem asserts that no fair election procedure exists for choosing from among three or more candidates. This note gives an exposition of Arrow’s theorem. It also describes the relation of election procedures betwe...

ion with 5 states. However, for the Buchi structure K4 of Figure 2(b),fabs(K4) and K4 are not fairly bisimilar.It therefore remains an open problem to construct, in general, a minimalstructure which is fairly bisimilar to K (where minimality is measured in thenumber of states).References[ASB94] A. Aziz, V. Singhal, F. Balarin, R.K. Brayton, and A.L. Sangiovanni-...

The simulation preorder for labeled transition systems is defined locally as a game that relates states with their immediate successor states. Simulation enjoys many appealing properties. First, simulation has a fully abstract semantics: system S simulates system I iff every computation tree embedded in the unrolling of I can be embedded also in the unrolling of S. Second, simulation has a logi...

Abstract: While fading effects have long been combatted in 2G wireless networks, primarly devoted to voice calls, they are now seen as an opportunity to increase the capacity of 3G networks that incorporate data traffic. The packet delay tolerance of data applications, such as file transfers and Web browsing for instance, allows the system flexibility in scheduling a user’s packets. Opportunist...

This paper studies a new problem called fair identification: given two parties, how should they identify each other in a fair manner. More precisely, if both parties are honest then they learn each other’s identity, and if anyone is cheating then either both of them learn each other’s identity or no one learns no information about the identity of the other. We propose a security model and a pro...

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...

The temporal logic of actions (TLA) provides operators to express liveness requirements in an abstract speciication model. TLA does not, however, provide high level composition mechanisms which are essential for synthesising and analysing complex behaviour. Contrastingly, the object oriented paradigm has proven itself in the development of structured speciications. However, most, if not all, of...

In this paper, we define fair computations in the π-calculus [18]. We follow Costa and Stirling’s approach for CCS-like languages [9,10] but exploit a more natural labeling method of process actions to filter out unfair process executions. The new labeling allows us to prove all the significant properties of the original one, such as unicity, persistence and disappearance of labels. It also tur...