Parallel Bayesian Search with No Coordination
نویسندگان
چکیده
منابع مشابه
Parallel Search with No Coordination
We consider a parallel version of a classical Bayesian search problem. k agents are looking for a treasure that is placed in one of the boxes indexed by N according to a known distribution p. The aim is to minimize the expected time until the first agent finds it. Searchers run in parallel where at each time step each searcher can “peek” into a box. A basic family of algorithms which are inhere...
متن کاملParallel Linear Search with no Coordination for a Randomly Placed Treasure
In STOC’16, Fraigniaud et al. consider the problem of finding a treasure hidden in one of many boxes that are ordered by importance. That is, if a treasure is in a more important box, then one would like to find it faster. Assuming there are many searchers, the authors suggest that using an algorithm that requires no coordination between searchers can be highly beneficial. Indeed, besides savin...
متن کاملThe Coordination of Parallel Search with Common Components
The preservation of common components has been recently isolated as a beneficial feature of genetic algorithms. One interpretation of this benefit is that the preservation of common components can direct the search process to focus on the most promising parts of the search space. If this advantage can be transferred from genetic algorithms, it may be possible to improve the overall effectivenes...
متن کاملSharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits and access to a server providing random strings. The method assumes no coordination among the processes. The error probability increases by only an additive negligible term, and the time complexity of each process incre...
متن کاملRational Coordination with no Communication or Conventions
We study pure coordination games where in every outcome, all players have identical payoffs, ‘win’ or ‘lose’. We identify and discuss a range of ‘purely rational principles’ guiding the reasoning of rational players in such games and analyze which classes of coordination games can be solved by such players with no preplay communication or conventions. We observe that it is highly nontrivial to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2019
ISSN: 0004-5411,1557-735X
DOI: 10.1145/3304111