This was a passionate indictment to the frequent ignorance from the developed North to the problems of the South. But here Iwant to call the attention to other type of ignorance towhich I have been confronted once and again as an Editor, a reviewer or an author of scientific papers in the field of network theory. It is about the ignorance of authors in one discipline to papers published by auth...

Popular matching and was extensively studied in recent years as an alternative to stable matchings. Both type of matchings are defined in the framework of Stable Marriage (SM) problem: in a given bipartite graph G = (A,B;E) each vertex u has a strict order of preference on its neighborhood. A matching M is popular, if for every matching M ′ of G, the number of vertices that prefer M ′ to M is a...

We consider the Stable Marriage Problem and the Stable Roommates Problem, two well-known types of the general class of Stable Matching Problems. They are combinatorial problems which can be solved by centralized algorithms in polynomial time. This requires to make public lists of preferences which agents would like to keep private. With this aim, we define the distributed version of these probl...

We consider instances of the Stable Roommates problem that arise from geometric representation of participants preferences: a participant is a point in a metric space, and his preference list is given by sorted distances to the other participants. We observe that, unlike in the general case, if there are no ties in the preference lists, there always exists a unique stable matching; a simple gre...

For examining vitamins, exact quantitations in natural matrices are essential. Up to date, one of the most accurate quantitation methods is the stable isotope dilution assay (SIDA), which is based on the use of isotopically labelled analogues of the analytes as internal standards. The merits of SIDA include the ideal compensation for losses, superior specificity and enhanced sensitivity due to ...

In this paper we describe an efficient algorithm that decides if a stable matching exists for a generalized stable roommates problem, where, instead of linear preferences, agents have partial preference orders on potential partners. Furthermore, we may forbid certain partnerships, that is, we are looking for a matching such that none of the matched pairs is forbidden, and yet, no blocking pair ...

It is known that there may not exist any stable matching for a given instance of the stable roommates problem. A stable partition is a structure that generalizes the notion of a stable matching; Tan (1991) proved that every instance of the stable roommates problem contains at least one such structure. In this paper we propose a new algorithm for finding a stable partition, and hence a new algor...