{
  "annotation_id": "091f5896-87bc-4c9e-bdd9-a7a6b7d1f692",
  "date_created": "2026-02-17T05:53:12.486000Z",
  "date_modified": "2026-02-17T05:53:12.486000Z",
  "file_hash": "04c59a3d24a8f8b688f4ed4f030b7992209304f68402e0fa00b95632de999ef2",
  "private": false,
  "record": {
    "abstract": "Given a c-colored graph G, a vertex of G is happy if it has the same color as all its neighbors. The notion of happy vertices was introduced by Zhang and Li to compute the homophily of a graph. Eto, et al. introduced the Maker-Maker version of the Happy vertex game, where two players compete to claim more happy vertices than their opponent. We introduce here the Maker-Breaker happy vertex game: two players, Maker and Breaker, alternately color the vertices of a graph with their respective colors. Maker aims to maximize the number of happy vertices at the end, while Breaker aims to prevent her. This game is also a scoring version of the Maker-Breaker Domination game introduced by Duchene, et al. as a happy vertex corresponds exactly to a vertex that is not dominated in the domination game. Therefore, this game is a very natural game on graphs and can be studied within the scope of scoring positional games. We initiate here the complexity study of this game, by proving that computing its score is PSPACE-complete on trees, NP-hard on caterpillars, and polynomial on subdivided stars. Finally, we provide the exact value of the score on graphs of maximum degree 2, and we provide an FPT-algorithm to compute the score on graphs of bounded neighborhood diversity. An important contribution of the paper is that, to achieve our hardness results, we introduce a new type of incidence graph called the literal-clause incidence graph for 2-SAT formulas. We prove that QMAX 2-SAT remains PSPACE-complete even if this graph is acyclic, and that MAX 2-SAT remains NP-complete, even if this graph is acyclic and has maximum degree 2, i.e. is a union of paths. We demonstrate the importance of this contribution by proving that Incidence, the scoring positional game played on a graph is also PSPACE-complete when restricted to forests.",
    "arxiv_id": "2601.07673",
    "authors": [
      "Mathieu Hilaire",
      "Perig Montfort",
      "Nacim Oijid"
    ],
    "categories": [
      "cs.DM",
      "cs.CC",
      "math.CO"
    ],
    "license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
    "title": "On the complexity of the Maker-Breaker happy vertex game",
    "url": "https://arxiv.org/abs/2601.07673",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e97e1dc9-9790-4a83-a3e4-71b8c9d7c0f7",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}