The Explorer-Director Game on Graphs
Pat Devlin, Erin Meger, Abigail Raz, and Polymath REU Participants

TL;DR
This paper analyzes the Explorer-Director game on graphs, providing structural insights into optimal strategies, and offers complete solutions for trees and lattices, advancing understanding of this adversarial pursuit game.
Contribution
It reduces the analysis of the game to minimal closed vertex sets and solves the game on trees and lattices, including strategy restrictions.
Findings
Structural characterization of optimal strategies.
Complete solution for trees under restricted strategies.
Analysis of the game on lattice graphs.
Abstract
The Explorer-Director game, first introduced by Nedev and Muthukrishnan, can be described as a game where two players -- Explorer and Director -- determine the movement of a token on the vertices of a graph. At each time step, the Explorer specifies a distance that the token must move hoping to maximize the amount of vertices ultimately visited, and the Director adversarially chooses where to move token in an effort to minimize this number. Given a graph and a starting vertex, the number of vertices that are visited under optimal play is denoted by . In this paper, we first reduce the study of to the determination of the minimal sets of vertices that are \textit{closed} in a certain combinatorial sense, thus providing a structural understanding of each player's optimal strategies. As an application, we address the problem on lattices and trees. In the case of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Complexity and Algorithms in Graphs
