This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the...

Peer-to-Peer (P2P) data integration combines the P2P infrastructure with traditional scheme-based data integration techniques. Some of the primary problems in this research area are the techniques to be used for querying, indexing and distributing documents among peers in a network especially when document files are in XML format. In order to handle this problem we describe an XML P2P system th...

High throughput is required in many tasks, especially real-time applications. A logical structure of parallel computing system for such applications is a pipeline of multiprocessor modules to be referred to as PMM. In this paper, a linear array based realization of PMM, referred to as PMMLA (PMM based on Linear Array), is proposed. The main design objective is to achieve uncompromised performan...

We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n − 1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation—as these terms are used in the fair-division literature—one, divide-and-conquer (D&C), minimizes the maximum number of players that any ...

This paper presents the design and implementation methodology of the JCQ system, a Java-based Continual Query system for update monitoring over Web information sources. A continual query is a standing query that monitors updates of interest using distributed triggers and notiies users whenever the updates reach speciied thresholds. In this paper we focus on the strategies and techniques develop...

We extend the classic cake-cutting problem to a situation in which the ”cake” is divided among families. Each piece of cake is owned and used simultaneously by all members of the family. A typical example of such a cake is land. We examine three ways to assess the fairness of such a division, based on the classic no-envy criterion: (a) Average envy-freeness means that for each family, the avera...

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

We develop the rst explicit procedures for exact envy-free chore division for 4 or more players. We also give a simple 3-person procedure. Our 4-person moving-knife scheme and n-person discrete algorithm are accomplished by exploiting a notion of \irrevocable advantage" for chores, and are motivated by similar solutions for cake-cutting by Brams, Taylor, and Zwicker. We discuss the diierences b...

It is well-known that the central limit theorem holds for partial sums of a stationary sequence (Xi) of m-dependent random variables with finite variance; however, the limit may be degenerate with variance 0 even if Var(Xi) 6= 0. We show that this happens only in the case when Xi − EXi = Yi − Yi−1 for an (m − 1)-dependent stationary sequence (Yi) with finite variance (a result implicit in earli...