Pairwise comparison matrices play a prominent role in multiple-criteria decision-making, particularly the analytic hierarchy process (AHP). Another form of preference modeling, called an incomplete pairwise matrix, is considered when one or more elements are missing. In this paper, algorithm proposed for optimal completion matrix. Our intention to numerically minimize maximum eigenvalue functio...

We develop theoretical underpinnings of pairwise random matching processes. We formalize the mechanics of matching, and study the links between properties of the different processes and trade frictions. A particular emphasis is placed on providing a mapping between matching technologies and informational constraints.

This paper presents an experimental preference tool des!gned, implemented and tested m the Eurotra pro)ect. The mechanism is based on preference rules which can either compare subtrees pairwise or single out a subtree on the basis of some specified constraints. Scoring permits combining the effects of various preference rules.

We study the problem of how well a tree metric is able to preserve the sum of pairwisedistances of an arbitrary metric. This problem is closely related to low-stretch metricembeddings and is interesting by its own flavor from the line of research proposed in theliterature.As the structure of a tree imposes great constraints on the pairwise distances, any embed-ding of a ...

In the present paper we introduce and study the notion of pairwise weakly Lindelof bitopological spaces and obtain some results. Further, we also study the pairwise weakly Lindelof subspaces and subsets, and investigate some of their properties. It was proved that a pairwise weakly Lindelof property is not a hereditary property.

Abstract: In this paper, we analyze the pairwise error probability (PEP) of distributed space-time codes, in which the source and the relay generate Alamouti space-time code in a distributed fashion. We restrict our attention to the space-time code construction for Protocol III in Nabar et al. (IEEE Journal on Selected Areas Communications 22(6): 1099-1109, 2004). In particular, we derive two c...

Game theory focuses on payoffs and typically ignores time constraints that play an important role in evolutionary processes where the repetition of games can depend on the strategies, too. We introduce a matrix game under time constraints, where each pairwise interaction has two consequences: both players receive a payoff and they cannot play the next game for a specified time duration. Thus ou...

In this paper we investigate the capabilities of constrained clustering in application to active exploration of music collections. Constrained clustering has been developed to improve clustering methods through pairwise constraints. Although these constraints are received as queries from a noiseless oracle, most of the methods involve a random procedure stage to decide which elements are presen...

Schema matching is a key task in several applications such as data integration and ontology engineering. All application fields require the matching of several schemes also known as ”holistic matching”, but the difficulty of the problem spawned much more attention to pairwise schema matching rather than the latter. In this paper, we propose a new approach for holistic matching. We suggest model...

Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...