Randomised Mutual Search for k2 Agents

Authors:
Jaap-Henk Hoepman
Affiliations:
-
Venue:
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Year:
2001

Citing 4
Cited 0

Mutual search

Journal of the ACM (JACM)
A note on randomized mutual search

Information Processing Letters
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic computations: Toward a unified measure of complexity

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the efficiency of randomised solutions to the mutual search problem of finding k agents distributed over n nodes. For a restricted class of so-called linear randomised mutual search algorithms we derive a lower bound of k-1/k+1 (n + 1) expected calls in the worst case. A randomised algorithm in the shared-coins model matching this bound is also presented. Finally we show that in general more adaptive randomised mutual algorithms perform better than the lower bound for the restricted case, even when given only private coins. A lower bound for this case is also derived.