The Complexity of Graph Exploration Games

by   Janosch Fuchs, et al.

The graph exploration problem asks a searcher to explore an unknown graph. This problem can be interpreted as the online version of the Traveling Salesman Problem. The treasure hunt problem is the corresponding online version of the shortest s-t-path problem. It asks the searcher to find a specific vertex in an unknown graph at which a treasure is hidden. Recently, the analysis of the impact of a priori knowledge is of interest. In graph problems, one form of a priori knowledge is a map of the graph. We survey the graph exploration and treasure hunt problem with an unlabeled map, which is an isomorphic copy of the graph, that is provided to the searcher. We formulate decision variants of both problems by interpreting the online problems as a game between the online algorithm (the searcher) and the adversary. The map, however, is not controllable by the adversary. The question is, whether the searcher is able to explore the graph fully or find the treasure for all possible decisions of the adversary. We prove the PSPACE-completeness of these games, whereby we analyze the variations which ask for the mere existence of a tour through the graph or path to the treasure and the variations that include costs. Additionally, we analyze the complexity of related problems that ask for a tour in the graph or a s-t path.


page 1

page 2

page 3

page 4


The Complexity of Online Graph Games

Online computation is a concept to model uncertainty where not all infor...

Achieving Competitiveness in Online Problems

In the setting of online algorithms, the input is initially not present ...

The Graph Exploration Problem with Advice

Moving an autonomous agent through an unknown environment is one of the ...

Neural Online Graph Exploration

Can we learn how to explore unknown spaces efficiently? To answer this q...

On the online path extension problem – Location and routing problems in board games

We consider an online version of a longest path problem in an undirected...

Path Defense in Dynamic Defender-Attacker Blotto Games (dDAB) with Limited Information

We consider a path guarding problem in dynamic Defender-Attacker Blotto ...

A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks

The online feasibility problem (for a set of sporadic tasks) asks whethe...

Please sign up or login with your details

Forgot password? Click here to reset