P_3-Games on Chordal Bipartite Graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang,, and Yue-Li Wang

TL;DR
This paper studies a combinatorial game played on chordal bipartite graphs, providing a polynomial-time algorithm to compute the Grundy number and determine the winning strategy for the first player.
Contribution
It introduces a polynomial-time algorithm for computing the Grundy number of the P_3-game on chordal bipartite graphs, enabling efficient strategy determination.
Findings
Polynomial-time algorithm for Grundy number computation
Efficient strategy decision for the first player
Characterization of the game on chordal bipartite graphs
Abstract
Let G=(V,E) be a connected graph. A set U subseteq V is convex if G[U] is connected and all vertices of V\U have at most one neighbor in U. Let sigma(W) denote the unique smallest convex set that contains W subseteq V. Two players play the following game. Consider a convex set U and call it the `playground.' Initially, U = emptyset. When U=V, the player to move loses the game. Otherwise, that player chooses a vertex x in V\U which is at distance at most two from U. The effect of the move is that the playground U changes into sigma(U cup {x}) and the opponent is presented with this new playground. A graph is chordal bipartite if it is bipartite and has no induced cycle of length more than four. In this paper we show that, when G is chordal bipartite, there is a polynomial-time algorithm that computes the Grundy number of the P_3-game played on G. This implies that there is an efficient…
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
TopicsGame Theory and Applications · Artificial Intelligence in Games · Advanced Graph Theory Research
