The Generalized Matcher Game

TL;DR

This paper generalizes the matcher game by replacing the $K_2$ with a general graph $F$, specifically analyzing the case where $F=P_3$, and provides results, bounds, and specific graph analyses.

Contribution

It introduces a generalized matcher game with arbitrary graph $F$, focusing on $F=P_3$, and offers new theoretical bounds and analyses for this game.

Findings

Established lower bounds for the generalized game.

Identified graph families where the game consumes all vertices.

Calculated game values for specific graph classes.

Abstract

Recently the matcher game was introduced. In this game, two players create a maximal matching by one player repeatedly choosing a vertex and the other player choosing a $K_2$ containing that vertex. One player tries to minimize the result and the other to maximize the result.In this paper we propose a generalization of this game where $K_2$ is replaced by a general graph $F$. We focus here on the case of $F=P_3$. We provide some general results and lower bounds for the game, investigate the graphs where the game ends with all vertices taken, and calculate the value for some specific families of graphs.