Easy impossibility proofs for distributed consensus problems
Distributed Computing
Solvability of the asynchronous ranking problem
Information Processing Letters
Coverings and minors: application to local computations in graphs
European Journal of Combinatorics
On the recognition of families of graphs with local computations
Information and Computation
Information Processing Letters
Graph relabelling systems and distributed algorithms
Handbook of graph grammars and computing by graph transformation
Solution of a problem in concurrent programming control
Communications of the ACM
The Power of Local Computations in Graphs with Initial Knowledge
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
A Characterization of Families of Graphs in Which Election Is Possible
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Locally Computable Enumerations
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Bilateral Ranking Negotiations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Hi-index | 0.00 |
In general, negotiations within a group of participants are processes, that starting with participants in some arbitrary (initial) states eventually will achieve an agreement with all participants being in the required negotiated states. Process of negotiation is performed according to a negotiation protocol. Here, an ordering of participants is taken as the negotiation goal; constructing a negotiation protocol for this purpose is referred to as the ranking problem. The formal method used for discussing the considered issue are local computations; in general, they consist in transforming states of the whole structure by way of transforming states of its substructures. The paper aims to discuss communication structures that admit negotiations limited to direct communications between participants of a single 'association' at a time. Necessary and sufficient conditions for existence of such a ranking protocol for considered structures are formulated and a universal protocol for ranking is given. The paper is a generalization of bilateral negotiations presented in [14], where negotiations are limited to associations containing at most two members; the multilateral protocol presented in this paper covers the case of bilateral negotiations.