Searching by heterogeneous agents

Dariusz Dereniowski; Łukasz Kuszner; Robert Ostrowski

doi:10.1016/j.jcss.2020.06.008

Searching by heterogeneous agents

Abstract

In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances in which the number of recontamination events is asymptotically quadratic in the tree size. Other negative results regard the NP-completeness of the monotone, and NP-hardness of an arbitrary (i.e., non-monotone) heterogeneous search in trees. These properties show that this problem behaves very differently from the classical edge search. On the other hand, if all edges of a particular label form a (connected) subtree of the input tree, then we show that optimal heterogeneous search strategy can be computed efficiently.

Citations

0

CrossRef
0

Web of Science
0

Scopus

Authors (3)

Cite as

Full text

full text is not available in portal

full content of the article see on external site open in new tab

Keywords

TEORIA ALGORYTMÓW,PRZESZUKIWANIE GRAFÓW,TEORIA GRAFÓW,ZŁOŻONOŚĆ OBLICZENIOWA

Details

Category:: Articles
Type:: artykuły w czasopismach
Published in:: JOURNAL OF COMPUTER AND SYSTEM SCIENCES no. 115, pages 1 - 21,
ISSN: 0022-0000
Language:: English
Publication year:: 2021
Bibliographic description:: Dereniowski D., Kuszner Ł., Ostrowski R.: Searching by heterogeneous agents// JOURNAL OF COMPUTER AND SYSTEM SCIENCES -Vol. 115, (2021), s.1-21
DOI:: Digital Object Identifier (open in new tab) 10.1016/j.jcss.2020.06.008
Verified by:: Gdańsk University of Technology