Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs

by   Fedor V. Fomin, et al.

We introduce the rendezvous game with adversaries. In this game, two players, Facilitator and Disruptor, play against each other on a graph. Facilitator has two agents, and Disruptor has a team of k agents located in some vertices of the graph. They take turns in moving their agents to adjacent vertices (or staying). Facilitator wins if his agents meet in some vertex of the graph. The goal of Disruptor is to prevent the rendezvous of Facilitator's agents. Our interest is to decide whether Facilitator can win. It appears that, in general, the problem is PSPACE-hard and, when parameterized by k, co-W[2]-hard. Moreover, even the game's variant where we ask whether Facilitator can ensure the meeting of his agents within τ steps is co-NP-complete already for τ=2. On the other hand, for chordal and P_5-free graphs, we prove that the problem is solvable in polynomial time. These algorithms exploit an interesting relation of the game and minimum vertex cuts in certain graph classes. Finally, we show that the problem is fixed-parameter tractable parameterized by both the graph's neighborhood diversity and τ.


page 1

page 2

page 3

page 4


Romeo and Juliet Meeting in Forest Like Regions

The game of rendezvous with adversaries is a game on a graph played by t...

Colouring (P_r+P_s)-Free Graphs

The k-Colouring problem is to decide if the vertices of a graph can be c...

Fast Neighborhood Rendezvous

In the rendezvous problem, two computing entities (called agents) locate...

On Structural Parameterizations of Node Kayles

Node Kayles is a well-known two-player impartial game on graphs: Given a...

Tipsy cop and drunken robber: a variant of the cop and robber game on graphs

Motivated by a biological scenario illustrated in the YouTube video < ht...

The general position avoidance game and hardness of general position games

Given a graph G, a set S of vertices in G is a general position set if n...

Subgraph Isomorphism on Graph Classes that Exclude a Substructure

We study Subgraph Isomorphism on graph classes defined by a fixed forbid...

Please sign up or login with your details

Forgot password? Click here to reset