Even though tree-based reliable multicast protocols are known to be most scalable for one-to-many sessions, there is still an open question whether these protocols are also scalable for many-to-many sessions. In this paper, we analyze and compare two promising multicast protocols the receiver-initiated protocol with NACK suppression and the tree-based protocol using a new spatial loss model. Th...

An Automatic Language Translation System’s quality depends mainly on that of two components: the Alignment approach and the Translation Model. In this paper, we will present an alignment approach that covers one-to-one, one-to-many, many-to-one, many-to-many alignment, whose output is used by a translation model based on Genetic Algorithm. The Translation Model searches for the decomposition of...

One of the challenges, of designing a negotiation agent, is to provide a unified framework. This allows heterogeneous agents to interact, despite their underlying architecture differences. In this paper, we presented a unified framework for e-commerce negotiation agent. The unified framework supports not only one-to-one and one-to-many negotiation, but also many-to-many negotiation. In supporti...

Automating negotiations in markets where multiple buyers and sellers operate is a scientific challenge of extraordinary importance. One-to-one negotiations are classically studied as bilateral bargaining problems, while one-to-many and many-to-many negotiations are studied as auctioning problems. This paper aims at bridging together these two approaches, analyzing agents’ strategic behavior in ...

Theories of inter-organisational co-ordination propose that information processing capabilities (structure, process and technology) must be aligned with information processing needs (environmental, partnership and task uncertainty), and that the fit between both is a strong determinant of performance. Electronic marketplaces dominate new developments in electronic commerce. While traditional mo...

This paper considers the incentive compatibility in many-to-many two-sided matching problems. We first show that the Blocking Lemma holds for many-to-many matchings under the extended max-min preference criterion and quota-saturability condition. This result extends the Blocking Lemma for one-to-one matching and for many-to-one matching to many-to-many matching problem. It is then shown that th...

For large-scale multimedia distributions, multicast is the preferred method of communication. ASM (Any Source Multicast) and SSM (SourceSpecific Multicast) are the two types of multicast used. ASM is designed for either many-to-many or one-to-many communication. SSM is derived from ASM. SSM is used when only one session member is allowed to send data. An example use of SSM could be an IPTV broa...

We develop a model of many-to-many matching with contracts which subsumes as special cases many-to-many matching markets and buyer–seller markets with heterogeneous and indivisible goods. In our setting, substitutable preferences are sufficient to guarantee the existence of stable outcomes; moreover, in contrast to results for the setting of many-to-one matching with contracts, if any agent’s p...